NEW UPPER BOUNDS ON CODES VIA ASSOCIATION SCHEMES AND LINEAR PROGRAMMING (2008)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
(Communicated by Eimear Byrne) Abstract. Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming distance d. Upper and lower bounds on A(n, d) have been a...
Lower bounds on the minimum average distance of binary codes (2007)
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
New Upper Bounds on A(n,d) (2005)
Mounits, Beniamin, Etzion, Tuvi, Litsyn, Simon
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...
Improved upper bounds on sizes of codes (2002)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn, Senior Member, Senior Member
Abstract—Let @ A denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance. For large values of, the best known upper bound, for fixed, is the Johnson...