Lower bounds on the minimum average distance of binary codes
Information Theory
2007-07-13 v1 Combinatorics
math.IT
Abstract
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
Cite
@article{arxiv.0706.3295,
title = {Lower bounds on the minimum average distance of binary codes},
author = {Beniamin Mounits},
journal= {arXiv preprint arXiv:0706.3295},
year = {2007}
}