Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others

DOI10.1007/BF01388558zbMath0802.94022OpenAlexW2000874261MaRDI QIDQ1321554

N. J. A. Sloane

Publication date: 28 April 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01388558

zbMATH Keywords

nonlinear codessingle-error-correcting codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (4)

What are all the best sphere packings in low dimensions? ⋮ A new sphere packing in 20 dimensions ⋮ Two new bounds on the size of binary codes with a minimum distance of three ⋮ NETWORK CODING WITH MODULAR LATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new table of constant weight codes
• New trellis codes based on lattices and cosets
• Binary codes with a minimum distance of four (Corresp.)
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• A linear construction for certain Kerdock and Preparata codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• The uniqueness of the Best code
• New family of single-error correcting codes

This page was built for publication: Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others