Repeated-root isodual cyclic codes over finite fields

From MaRDI portal
Publication:2947074

DOI10.1007/978-3-319-18681-8_10zbMATH Open1328.94090arXiv1303.1870OpenAlexW1177344880MaRDI QIDQ2947074FDOQ2947074


Authors: Aicha Batoul, Kenza Guenda, T. Aaron Gulliver Edit this on Wikidata


Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1303.1870




Recommendations




Cites Work


Cited In (9)





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)