Abstract
A trace formula for quasi-cyclic codes over rings of characteristic not coprime with the co-index is derived. The main working tool is the Generalized Discrete Fourier Transform (GDFT), which in turn relies on the Hasse derivative of polynomials. A characterization of Type II self-dual quasi-cyclic codes of singly even co-index over finite fields of even characteristic follows. Implications for generator theory are shown. Explicit expressions for the combinatorial duocubic, duoquintic and duoseptic constructions in characteristic two over finite fields are given.
Similar content being viewed by others
References
E. Bannai S. T. Dougherty M. Harada M. Oura (1999) ArticleTitleType II codes, even unimodular lattices, and invariant rings IEEE Transaction Information Theory 45 1194–1205 Occurrence Handle2000i:94091
K. Betsumiya, The Type II property for self-dual codes over finite fields of characteristic two, preprint.
K. Betsumiya S. Ling F. R. Nemenzo (2004) ArticleTitleType II codes over \({\bf F}_{2^{m}} + u{\bf F}_{2^{m}}\) Discrete Mathematics 275 43–65 Occurrence Handle10.1016/S0012-365X(03)00097-9 Occurrence Handle2004i:94051
G. Castagnoli J. L. Massey P. A. Schoeller N. Seemann Particlevon (1991) ArticleTitleOn repeated-root cyclic codes IEEE Transactions on Information Theory 37 337–342 Occurrence Handle10.1109/18.75249
Z. Chen, http://www.tec.hkr.se/~chen/research/codes/.
J. Conan C. Séguin (1993) ArticleTitleStructural properties and enumeration of quasi-cyclic codes AAECC 4 25–39 Occurrence Handle10.1007/BF01270398
B. K. Dey (2004) ArticleTitleOn existence of good self-dual quasi-cyclic codes IEEE Transactions on Information Theory 50 1794–1798 Occurrence Handle2005e:94275
S. T. Dougherty P. Gaborit M. Harada P. Solé (1999) ArticleTitleType II codes over F2+u F2 IEEE Transactions on Information Theory 45 32–45
T. A. Gulliver V. K. Bhargava (1991) ArticleTitleSome best rate 1/p and rate (p−1)/p systematic quasi-cyclic codes IEEE Transactions on Information Theory 37 552–555 Occurrence Handle10.1109/18.79911 Occurrence Handle1145816
T. A. Gulliver V. K. Bhargava (1992) ArticleTitleNine good (m−1)/pm quasi-cyclic codes IEEE Transactions on Information Theory 38 1366–1369 Occurrence Handle1168755
T. A. Gulliver V. K. Bhargava (1992) ArticleTitleSome best rate 1/p and rate (p−1)/p systematic quasi-cyclic codes over GF(3) and GF(4) IEEE Transactions on Information Theory 38 1369–1374 Occurrence Handle1168756
T. A. Gulliver V. K. Bhargava (1993) ArticleTitleTwelve good rate (m−r)/pm binary quasi-cyclic codes IEEE Transactions on Information Theory 39 1750–1751 Occurrence Handle10.1109/18.259670
H. Hasse (1936) ArticleTitleTheorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik J. Reine Angew. Math. 175 50–54 Occurrence Handle0013.34103
K. Lally P. Fitzpatrick (2001) ArticleTitleAlgebraic structure of quasicyclic codes Disc. Appl. Math. 111 157–175 Occurrence Handle10.1016/S0166-218X(00)00350-4 Occurrence Handle2002f:94058
R. Lidl H. Niederreiter (1997) Finite Fields Cambridge University Press Cambridge
S. Ling P. Solé (2001) ArticleTitleType II codes over F4+u F4 European J. Comb. 22 983–997
S. Ling P. Solé (2001) ArticleTitleOn the algebraic structure of quasi-cyclic codes I: finite fields IEEE Transactions on Information Theory 47 2751–2760
S. Ling P. Solé (2003) ArticleTitleOn the algebraic structure of quasi-cyclic codes II: chain rings Des., Codes and Crypto. 30 113–130
S. Ling P. Solé (2005) ArticleTitleOn the algebraic structure of quasi-cyclic codes III: generator theory IEEE Transactions on Information Theory 51 2692–2700 Occurrence Handle10.1109/TIT.2005.850142
F. J. MacWilliams N. J. A. Sloane (1977) The Theory of Error Correcting Codes North-Holland Amsterdam
J. L. Massey and S. Serconek, Linear complexity of periodic sequences: a general theory, Advances in Cryptology—Crypto ’96 (N. Koblitz ed.), LNCS 1109 (1996), pp. 358–371.
B. R. McDonald (1974) Finite Rings with Identity Marcel Dekker New York
A. Vardy (1998) Trellis structure of codes V. S. Pless W. C. Huffman (Eds) Handbook of Coding Theory NumberInSeriesVol. II Elsevier Science Amsterdam 1989–2117
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: T. Helleseth
AMS Classification: 94B05, 94B15, 11T71
Part of this work was done while the first named author was visiting CNRS-I3S, ESSI, Sophia Antipolis, France. The author would like to thank the institution for the kind hospitality. The research of the first two authors is partially supported by MOE-ARF research Grant R-146-000-029-112 and DSTA research Grant R-394-000-011-422.
Rights and permissions
About this article
Cite this article
Ling, S., Niederreiter, H. & Solé, P. On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots. Des Codes Crypt 38, 337–361 (2006). https://doi.org/10.1007/s10623-005-1431-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-1431-7