Cyclic codes and quadratic residue codes over Z4

A set of n-tuples over Z/sub 4/ is called a code over Z/sub 4/ or a Z/sub 4/ code if it is a Z/sub 4/ module. We prove that any Z/sub 4/-cyclic code C has generators of the form (fh, 2fg) where fgh=x/sup n/-1 over Z/sub 4/ and |C|=4/sup deg g/2/sup deg h/. We also show that C/sup /spl perp// has generators of the form (g/sup */h/sup */, 2f/sup */g/sup */). We show that idempotent generators exist for certain cyclic codes. A particularly interesting family of Z/sub 4/-cyclic codes are quadratic residue codes. We define such codes in terms of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over a field. We show that the nonlinear binary images of the extended QR codes of lengths 32 and 48 have higher minimum weights than comparable known linear codes.

[1]  N. J. A. Sloane,et al.  The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[2]  Vera Pless,et al.  Duadic Codes , 1984, IEEE Trans. Inf. Theory.

[3]  N. J. A. Sloane,et al.  Self-Dual Codes over the Integers Modulo 4 , 1993, J. Comb. Theory, Ser. A.

[4]  N. J. A. Sloane,et al.  Modular andp-adic cyclic codes , 1995, Des. Codes Cryptogr..

[5]  Patrick Solé,et al.  Quaternary constructions of formally self-dual binary codes and unimodular lattices , 1993, Algebraic Coding.

[6]  A. Robert Calderbank,et al.  Quaternary quadratic residue codes and unimodular lattices , 1995, IEEE Trans. Inf. Theory.

[7]  Tom Verhoeff,et al.  An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.