Construction of quasi-cyclic self-dual codes

From MaRDI portal
Publication:413565

DOI10.1016/J.FFA.2011.12.006zbMATH Open1250.94065arXiv1201.6012OpenAlexW2095491534MaRDI QIDQ413565FDOQ413565


Authors: Sunghyu Han, Jon-Lark Kim, Heisook Lee, Yoonjin Lee Edit this on Wikidata


Publication date: 7 May 2012

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

Abstract: There is a one-to-one correspondence between ell-quasi-cyclic codes over a finite field mathbbFq and linear codes over a ring R=mathbbFq[Y]/(Ym1). Using this correspondence, we prove that every ell-quasi-cyclic self-dual code of length mell over a finite field mathbbFq can be obtained by the {it building-up} construction, provided that char (mathbbFq)=2 or qequiv1pmod4, m is a prime p, and q is a primitive element of mathbbFp. We determine possible weight enumerators of a binary ell-quasi-cyclic self-dual code of length pell (with p a prime) in terms of divisibility by p. We improve the result of [3] by constructing new binary cubic (i.e., ell-quasi-cyclic codes of length 3ell) optimal self-dual codes of lengths 30,36,42,48 (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When m=5, we obtain a new 8-quasi-cyclic self-dual [40,20,12] code over mathbbF3 and a new 6-quasi-cyclic self-dual [30,15,10] code over mathbbF4. When m=7, we find a new 4-quasi-cyclic self-dual [28,14,9] code over mathbbF4 and a new 6-quasi-cyclic self-dual [42,21,12] code over mathbbF4.


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




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Construction of quasi-cyclic self-dual codes

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