On the failing cases of the Johnson bound for error-correcting codes
From MaRDI portal
Publication:1010772
zbMath1206.94116MaRDI QIDQ1010772
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
Related Items (2)
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