On quasi-cyclic codes as a generalization of cyclic codes

From MaRDI portal
Publication:714456

DOI10.1016/J.FFA.2012.06.003zbMATH Open1267.94138arXiv1108.3754OpenAlexW2111162716MaRDI QIDQ714456FDOQ714456


Authors: Morgan Barbier, Christophe Chabot, Guillaume Quintin Edit this on Wikidata


Publication date: 11 October 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 derivated codes beating the known bounds as well.


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




Recommendations




Cites Work


Cited In (28)

Uses Software





This page was built for publication: On quasi-cyclic codes as a generalization of cyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714456)