Explicit representation and enumeration formula for self-dual cyclic codes over R of length 2^s n (n odd), with Gray-map application to 2-quasi-cyclic codes over F_{2^m}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Construction and enumeration for self-dual cyclic codes of even length over $\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}$
Explicit representation and enumeration formula for self-dual cyclic codes over R of length 2^s n (n odd), with Gray-map application to 2-quasi-cyclic codes over F_{2^m}.