Lower bounds on the minimum average distance of binary codes
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
cs.IT↗
arXiv subjects
Beniamin Mounits
Publications and source records attributed to Beniamin Mounits.
New Upper Bounds on A(n,d)
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.
cs.IT↗