Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Seth Gannon"'
Autor:
Seth Gannon, Hamid Kulosman
Publikováno v:
Scientific Annals of Computer Science, Vol XXXIV, Iss 1, Pp 23-38 (2024)
We show that a necessary and sufficient condition for a cyclic code C of length N over a finite chain ring R (whose maximal ideal has nilpotence 2) to be an LCD code is that C = (f(x)), where f(X) is a self-reciprocal monic divisor of X^N − 1 in R[
Externí odkaz:
https://doaj.org/article/ce9e1422d3ec428cb17f94df85a2d6a7
