Karlin double circulant code

Karlin double circulant code[1]

Description

Member of the family of \([2m+2,m+1]\) double circulant codes such that \(m\) is prime of the form \(8k+3\) for some \(k\), and \(2m+2\) is a multiple of eight. See [2; Ch. 16] for their generator matrix.

Cousins

Cyclic linear \(q\)-ary code— Karlin double circulant codes can be mapped to extended cyclic and extended quadratic-residue codes over \(GF(4)\) [2; Ch. 16].
Quadratic-residue (QR) code— Karlin double circulant codes can be mapped to extended cyclic and extended quadratic-residue codes over \(GF(4)\) [2; Ch. 16].

Member of code lists

Primary Hierarchy

Classical Domain

Binary Kingdom

Binary codeECC

Binary group-orbit codeECC

Linear binary codeLinear \(q\)-ary Linear code over \(\mathbb{Z}_q\) ECC

Parents

Linear binary code

Quasi-cyclic codeECC

Self-dual linear codeSelf-dual additive Linear \(q\)-ary ECC

Karlin double circulant codes are self-dual doubly even codes [2; Ch. 16]

Karlin double circulant code

Children

\([24, 12, 8]\) Extended Golay code

The extended Golay code is equivalent to the Karlin double circulant code for \(m=11\) [2; Ch. 16].

\([2^r,2^r-r-1,4]\) Extended Hamming code

The extended Hamming code is equivalent to the Karlin double circulant code for \(m=3\) [2; Ch. 16].

References

[1]: M. Karlin, “New binary coding results by circulants”, IEEE Transactions on Information Theory 15, 81 (1969) DOI
[2]: F. J. MacWilliams and N. J. A. Sloane. The theory of error correcting codes. Elsevier, 1977.

Page edit log

Victor V. Albert (2025-01-08) — most recent

Cite as:

“Karlin double circulant code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2025. https://errorcorrectionzoo.org/c/karlin

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/bits/cyclic/karlin.yml.