Abstract
The ring decomposition technique of part I is extended to the case when the factors in the direct product decomposition are no longer fields but arbitrary chain rings. This includes not only the case of quasi-cyclic codes over rings but also the case of quasi-cyclic codes over fields whose co-index is no longer prime to the characteristic of the field. A new quaternary construction of the Leech lattice is derived.
Similar content being viewed by others
References
E. Bannai, S. T. Dougherty, M. Harada and M. Oura, Type II codes, even unimodular lattices, and invariant rings, IEEE Trans. Inform. Theory, Vol. (45) (1999) pp. 1194–1205.
Y. Berger and Y. Béery, The twisted squaring construction trellis complexity, and generalized weights of BCH and QR codes, IEEE Trans. Inform. Theory, Vol. (42) (1996) pp. 1817–1827.
A. Bonnecaze, P. Soléand A. R. Calderbank, Quaternary quadratic residue codes and unimodular lattices, IEEE Trans. Inform. Theory, Vol. (41) (1995) pp. 366–377.
Z. Chen, http://www.tec.hkr.se/_chen/research/codes/
J. Conan and C. Séguin, Structural properties and enumeration of quasi-cyclic codes, AAECC, Vol. (4) (1993) pp. 25–39.
S. T. Dougherty, P. Gaborit, M. Harada and P. Solé, Type II codes over F 2 + uF2, IEEE Trans. Inform. Theory, Vol. (45) (1999) pp. 32–45.
M. Esmaeili, T. A. Gulliver, N. P. Secord and S. A. Mahmoud, A link between quasi-cyclic codes and convolutional codes, IEEE Trans. Inform. Theory, Vol. (44) (1998) pp. 431–435.
W. Feit, A self-dual even ð96; 48; 16Þ code, IEEE Trans. Inform. Theory, Vol. (20) (1974) pp. 136–138.
G. D. Forney, Coset codes II: binary lattices, IEEE Trans. Inform. Theory, Vol. (34) (1988) pp. 1152–1187.
T. A. Gulliver and V. K. Bhargava, Some best rate 1/p and rate (p − 1)/p systematic quasi-cyclic codes, IEEE Trans. Inform. Theory, Vol. (37) (1991) pp. 552–555.
T. A. Gulliver and V. K. Bhargava, Nine good (m − 1)/pm quasi-cyclic codes, IEEE Trans. Inform. Theory, Vol. (38(1992) pp. 1366–1369.
T.A. Gulliver and V.K.Bhargava Some bestrate1/pand ratep−1/psystematicquasi-cyclic codes overGF3andGF4, IEEE Trans. Inform. Theory, Vol. (38(1992) pp. 1369–137
T.A.GulliverandV.K.BhargavaTwelvegoodratem−r/pmbinaryquasi-cycliccodes, IEEE Trans. Inform. Theory, Vol. (391993) pp. 1750–175
W. C. Huffman, Codes and groups, In (V. S. Pless and W. C. Huffman eds.) Handbook of Coding Theory, Vol. II, Elsevier Science, Amsterdam (1998) pp. 1345–1440.
G. Hughes, Codes and arrays from cocycles, Ph.D. Thesis, Royal Melbourne Institute of Technology (2000).
G. Hughes, Constacyclic codes, cocycles and a u + v j u − v construction, IEEE Trans. Inform. Theory, Vol. (46) (2000) pp. 674–680.
T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inform. Theory, Vol. (20) (1974) p. 679.
F. K. Kschichang and S. Pasupathy, Some ternary and quaternary codes and associated sphere packings, IEEE Trans. Inform. Theory, Vol. (38) (1992) pp. 227–246.
K. Lally and P. Fitzpatrick, Algebraic structure of quasicyclic codes, Disc. Appl. Math., Vol. (111) (2001) pp. 157–175.
S. Ling and P. Solé, Type II codes over F4 + uF4, European J. Comb., Vol. (22) (2001) pp. 983–997.
S. Ling and P. Solé, On the algebraic structure of quasi-cyclic codes I: finite fields, IEEE Trans. Inform. Theory, Vol. (47) (2001) pp. 2751–2760.
F. J. MacWilliams, N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland (1977).
B. R. McDonald, Finite rings with identity, Marcel Dekker, New York (1974).
G. H. Norton and A. Salagean, On the Hamming distance of linear codes over a finite chain ring, IEEE Trans. Inform. Theory, Vol. (46) (2000) pp. 1060–1067.
G. H. Norton and A. Salagean, On the structure of linear and cyclic codes over a finite chain ring, AAECC, Vol. (10) (2000) pp. 489–506.
V. Pless, Symmetry codes over GF(3Þ and new 5-designs, J. Comb. Theory, Vol. (12) (1972) pp. 119–142.
N. J. A. Sloane, S. M. Reddy and C.-L. Chen, New binary codes, IEEE Trans. Inform. Theory, Vol. (18) (1972) pp. 503–510.
N. J. A. Sloane and J. G. Thompson, Cyclic self-dual codes, IEEE Trans. Inform. Theory, Vol. (29) (1983) pp. 364–366.
G. Solomon and H. C. A. van Tilborg, A connection between block codes and convolutional codes, SIAM J. Appl. Math., Vol. (37) (1979) pp. 358–369.
A. Vardy, Trellis structure of codes, In (V. S. Pless and W. C. Huffman eds.), Handbook of Coding Theory, Vol. II, Elsevier Science, Amsterdam (1998) pp. 1989–2118.
E. J. Weldon, Jr., Long quasi-cyclic codes are good, IEEE Trans. Inform. Theory, Vol. (16) (1970) p. 130.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ling, S., Solé, P. On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings. Designs, Codes and Cryptography 30, 113–130 (2003). https://doi.org/10.1023/A:1024715527805
Issue Date:
DOI: https://doi.org/10.1023/A:1024715527805