New Bounds on the Minimum Average Distance of Binary Codes
Keywords:Binary code, Hamming distance, Minimum average Hamming distance.
The minimum average Hamming distance of binary codes of length n and cardinality M is denoted by b(n,M). All the known lower bounds b(n,M) are useful when M is at least of size about 2n-1/n . In this paper, for large n, we improve upper and lower bounds for b(n,M).
Keywords: Binary code; Hamming distance; Minimum average Hamming distance.
© 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
DOI: 10.3329/jsr.v2i3.2708 J. Sci. Res. 2 (3), 489-493 (2010)
How to Cite
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.