On the failing cases of the Johnson bound for error-correcting codes

zbMATH Open1206.94116MaRDI QIDQ1010772FDOQ1010772

Authors: Wolfgang Haas 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117239

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Improved upper bounds on sizes of codes
• New single-error-correcting codes
• A new upper bound for single error-correcting codes
• A simple proof of the improved Johnson bound for binary codes
• Perfect Single Error-Correcting Codes in the Johnson Scheme

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65) Triple systems (05B07)

Cited In (3)

• On the Nonexistence of Perfect Codes in the Johnson Scheme
• On optimal binary codes with unbalanced coordinates
• A simple proof of the improved Johnson bound for binary codes

This page was built for publication: On the failing cases of the Johnson bound for error-correcting codes

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