DocumentCode
2941016
Title
A bound for codes with given minimum and maximum distances
Author
Helleseth, Tor ; Klove, Torleiv ; Levenshtein, Vladimir I.
Author_Institution
Dept. of Inf., Bergen Univ.
fYear
2006
fDate
9-14 July 2006
Firstpage
292
Lastpage
296
Abstract
A new upper bound on the cardinality of codes in the Hamming space with given minimum and maximum distances is proved. The bound is compared to some known bounds, and some classes of codes for which the new bound is tight are given
Keywords
Hamming codes; Hamming space; codes; maximum distances; minimum distances; upper bound; Bismuth; Codes; Galois fields; Informatics; Joining processes; Linear programming; Mathematics; Polynomials; Upper bound; Vectors; bounds; codes; linear programming; orthogonal arrays; the Hamming space;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261600
Filename
4035969
Link To Document