TY - JOUR
T1 - Improvement on the Johnson upper bound for error-correcting codes
AU - Mounits, Beniamin
AU - Etzion, Tuvi
AU - Litsyn, Simon
PY - 2002
Y1 - 2002
N2 - Let A(n, d) denote the maximum possible number of codewords in a binary code of length n and minimum Hamming distance d. For large values of n the best known upper bound, for fixed d, is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of n and d, and for each d there are infinitely many values of n for which the new bound is better than the Johnson bound.
AB - Let A(n, d) denote the maximum possible number of codewords in a binary code of length n and minimum Hamming distance d. For large values of n the best known upper bound, for fixed d, is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of n and d, and for each d there are infinitely many values of n for which the new bound is better than the Johnson bound.
UR - https://www.scopus.com/pages/publications/0036352115
U2 - 10.1109/ISIT.2002.1023617
DO - 10.1109/ISIT.2002.1023617
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036352115
SN - 2157-8095
SP - 345
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
M1 - 345
ER -