Repeated-root isodual cyclic codes over finite fields
From MaRDI portal
Abstract: This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.
Recommendations
Cites work
Cited in
(9)- Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
- Cyclic isodual and formally self-dual codes over F_q+ F_q
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- A construction of self-dual skew cyclic and negacyclic codes of length \(n\) over \(\mathbb{F}_{p^n}\)
- On LCD, self dual and isodual cyclic codes over finite chain rings
- On isodual cyclic codes over finite chain rings
- Isodual cyclic codes over finite fields of odd characteristic
- Some new constructions of isodual and LCD codes over finite fields
- Structure of repeated-root constacyclic codes of length 8 ^m p^n
This page was built for publication: Repeated-root isodual cyclic codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947074)