A new upper bound for binary codes with minimum distance four

DOI10.1016/S0012-365X(97)00199-4MaRDI QIDQ1584302zbMATH OpenOpenAlexFDO

Authors Jun Kyo Kim, Sang Geun Hahn

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

binary codesone-error-correcting codesupper bound

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• A new upper bound for single error-correcting codes
• A table of upper bounds for binary codes
• Bounds for binary codes of length less than 25
• On the maximum cardinality of binary constant weight codes with prescribed distance
• Binary codes with a minimum distance of four (Corresp.)

Cites work

• 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
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 193433 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)

Cited in

(8)

• Two new bounds on the size of binary codes with a minimum distance of three
• A new upper bound for single error-correcting codes
• scientific article; zbMATH DE number 4018402 (Why is no real title available?)
• The maximum number of minimal codewords in an \([n,k]\)-code
• Binary codes with a minimum distance of four (Corresp.)
• A table of upper bounds for binary codes
• A simple proof of the improved Johnson bound for binary codes
• Error-correcting codes over an alphabet of four elements

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

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