On upper bounds for unrestricted binary-error-correcting codes

DOI10.1109/TIT.1971.1054656MaRDI QIDQ5639605zbMATH OpenFDO

Authors S. M. Johnson

Publication date 1971

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1971.1054656

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(8)

• Uniform hypergraphs containing no grids
• Construction of several classes of maximum codes
• The sextuply shortened binary Golay code is optimal
• Upper bounds for constant weight error correcting codes
• Algebraic theory of block codes detecting independent errors
• On the upper bound of the size of the \(r\)-cover-free families
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• 2-cancellative hypergraphs and codes

This page was built for publication: On upper bounds for unrestricted binary-error-correcting codes

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