On upper bounds for unrestricted binary-error-correcting codes

DOI10.1109/TIT.1971.1054656zbMath0231.94008MaRDI QIDQ5639605

Selmer Johnson

Publication date: 1971

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (8)

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

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