A new upper bound for binary codes with minimum distance four

DOI10.1016/S0012-365X(97)00199-4zbMath0949.94012OpenAlexW2019417807MaRDI QIDQ1584302

Sang Geun Hahn, Jun Kyo Kim

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

upper boundbinary codesone-error-correcting codes

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• Binary codes with a minimum distance of four (Corresp.)
• Bounds for binary codes of length less than 25

This page was built for publication: A new upper bound for binary codes with minimum distance four