Abstract
In this paper we give several constructions of cyclic codes over finite fields that are monomially equivalent to their dual, where the characteristic of the field divides the length of the code. These are called repeated-root cyclic isodual codes over finite fields. The constructions are based on the field characteristic, the generator polynomial and the length of the code.
Author supplied keywords
Cite
CITATION STYLE
Batoul, A., Guenda, K., & Gulliver, T. A. (2015). Repeated-root isodual cyclic codes over finite fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9084, pp. 119–132). Springer Verlag. https://doi.org/10.1007/978-3-319-18681-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
