TY - JOUR
T1 - New upper bounds on A(n,d)
AU - Mounits, Beniamin
AU - Etzion, Tuvi
AU - Litsyn, Simon
N1 - Publisher Copyright:
© 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
PY - 2005
Y1 - 2005
N2 - Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds improve on the best known analytic bounds. Several new record bounds are obtained for codes with small lengths.
AB - Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds improve on the best known analytic bounds. Several new record bounds are obtained for codes with small lengths.
UR - http://www.scopus.com/inward/record.url?scp=85114329619&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2005.1523472
DO - 10.1109/ISIT.2005.1523472
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:85114329619
SN - 2157-8095
VL - 2005-January
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
M1 - 1523472
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -