On perfect constant weight codes
Generalizing a construction of \textit{J. H. van Lint} and \textit{L. Tolhuizen} [Design, Codes, and Cryptography 18, 231-234 (1999; Zbl 0963.94038)], the authors consider perfect single error-correcting codes of length \(n\) over the alphabet \(Q\) of \(2^k+1\) symbols, \(k\geq 1\) (note that \(k=1\) was handled in [loc. cit.]). The main result of the paper, which is proved making use of the cyclic \(t\)-ary Hamming code, is Theorem 1:NEWLINENEWLINENEWLINELet \(t= 2^k\), \(w= t+1\), and \(n= w+1\). There exists a perfect single error-correcting constant weight code of length \(n\) and weight \(w\) over an alphabet of size \(w\).NEWLINENEWLINENEWLINEThe paper ends with a look at quaternary codes.NEWLINENEWLINEFor the entire collection see [Zbl 0960.00079].
- On perfect ternary constant weight codes
- On the reconstruction of perfect codes
- Perfect codes and balanced generalized weighing matrices
- Local duality theorem for \(q\)-ary 1-perfect codes
- Perfect codes and balanced generalized weighing matrices. II
- Perfect 1-error-correcting Lipschitz weight codes
- A product construction for perfect codes over arbitrary alphabets (Corresp.)
- Study on cipher propertys of constant weight codes
- scientific article; zbMATH DE number 3557661 (Why is no real title available?)
- scientific article; zbMATH DE number 1103480 (Why is no real title available?)
- Perfect 1-error-correcting Hurwitz weight codes
- scientific article; zbMATH DE number 3801447 (Why is no real title available?)
- scientific article; zbMATH DE number 6418825 (Why is no real title available?)
- Constant weight perfect and D-representable codes
- Non-Binary Diameter Perfect Constant-Weight Codes
- Single-error-correcting codes for constant-weight data words
- A family of diameter perfect constant-weight codes from Steiner systems
- Jack van Lint (1932--2004): a survey of his scientific work
This page was built for publication: On perfect constant weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2717201)
