Lower Bounds On The Minimum Average Distance Of Binary Codes

Mounits Beniamin. Arxiv 2007

[Paper]    
ARXIV

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

Similar Work

• On The Vc-dimension Of Binary Codes
• New Upper Bounds On A(nd)
• An Approximate Coding-rate Versus Minimum Distance Formula For Binary Codes
• Constructing Error-correcting Binary Codes Using Transitive Permutation Groups