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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
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}.
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}.
-
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}.