A new upper bound for single error-correcting codes

MaRDI QIDQ2770349zbMATH OpenFDO

Authors Jun Kyo Kim

Publication date 7 February 2002

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

upper boundbinary code

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial aspects of packing and covering (05B40)

Recommendations

• A new upper bound for binary codes with minimum distance four
• Improved upper bounds on sizes of codes
• A table of upper bounds for binary codes
• Improved lower bounds on sizes of single-error correcting codes
• Bounds for binary codes of length less than 25

Cited in

(8)

• AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES
• A reduced upper bound on the error correction ability of codes (Corresp.)
• Error-correcting codes over an alphabet of four elements
• A new upper bound on the rate of non-binary codes
• A new two-error-correcting binary code of length 16
• Bounds and constructions for codes correcting unidirectional errors
• On the failing cases of the Johnson bound for error-correcting codes
• A new upper bound for binary codes with minimum distance four

This page was built for publication: A new upper bound for single error-correcting codes

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