On the structure of optimal error-correcting codes

DOI10.1016/S0012-365X(97)00102-7MaRDI QIDQ1377733zbMATH OpenOpenAlexFDO

Authors Patric R. J. Östergård

Publication date 10 May 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00102-7

zbMATH Keywords

error-correcting codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 1933266
• scientific article; zbMATH DE number 2148772
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Codes of length 2 correcting single errors of limited size
• Improved lower bounds on sizes of single-error correcting codes

Cites work

• scientific article; zbMATH DE number 871187 (Why is no real title available?)
• Binary codes with a minimum distance of four (Corresp.)
• Kernels of nonlinear Hamming codes
• New single-error-correcting codes
• The uniqueness of the Best code
• Unit sphere packings and coverings of the Hamming space

Cited in

(9)

• scientific article; zbMATH DE number 2081120 (Why is no real title available?)
• Reinforcement learning for optimal error correction of toric codes
• The complexity of error-correcting codes
• Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
• scientific article; zbMATH DE number 6516526 (Why is no real title available?)
• Maximum-rank array codes and their application to crisscross error correction
• On a class of efficient error-limiting variable-length codes
• On Optimal k-Deletion Correcting Codes

This page was built for publication: On the structure of optimal error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377733)