Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Gannon, Seth"'
Autor:
Gannon, Seth, Kulosman, Hamid
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol\'e about the linear programming bound for LCD codes the notion $\mathrm{LCD}[n,k]$ was defined for binary LCD $[n,k]$-codes. We find the formula for $\mathrm{LCD}[n,2]$.
Externí odkaz:
http://arxiv.org/abs/1909.00253
Autor:
Gannon, Seth, Kulosman, Hamid
We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].
Externí odkaz:
http://arxiv.org/abs/1905.12309
Autor:
GANNON, Seth, KULOSMAN, Hamid
Publikováno v:
Scientific Annals of Computer Science; 2024, Vol. 34 Issue 1, p23-38, 16p
