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.

Additional Metadata
Keywords	Binary codes, minimum average distance, linear programming
ACM	Combinatorics (acm G.2.1)
THEME	Logistics (theme 3)
Publisher	Cornell University Library
Series	arXiv.org e-Print archive
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Mounits, B. (2007). Lower bounds on the minimum average distance of binary codes. arXiv.org e-Print archive. Cornell University Library .

Additional Files
Publisher Version

See Also
article Lower bounds on the minimum average distance of binary codes B. Mounits (Beniamin)
article Lower bounds on the minimum average distance of binary codes B. Mounits (Beniamin)
article Lower bounds on the minimum average distance of binary codes B. Mounits (Beniamin)
article Lower bounds on the minimum average distance of binary codes B. Mounits (Beniamin)

Publication