Explicit representation, enumeration, and efficient construction method for all self-dual cyclic codes of length p^s over F_{p^m} + u F_{p^m}.
Q., Jitman S., An explicit representation and enumeration for self-dual cyclic codes over F2m + uF2m of length 2 s
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
-
An efficient method to construct self-dual cyclic codes of length $p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Explicit representation, enumeration, and efficient construction method for all self-dual cyclic codes of length p^s over F_{p^m} + u F_{p^m}.