Title :
New upper bounds on A(n, d)
Author :
Mounits, Beniamin ; Etzion, Tuvi ; Litsyn, Simon
Author_Institution :
Dept. of Math., Technion-Israel Inst. of Technol., Haifa
Abstract :
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
Keywords :
Hamming codes; binary codes; linear programming; A(n, d) coding theory quantity; analytic bounds; binary code; counting arguments; linear programming; maximum codeword number; minimum Hamming distance; record bounds; upper bounds; Binary codes; Computer science; Hamming distance; Linear programming; Mathematics; Upper bound;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523472
