文章基本信息
- 标题：New Bounds on the Minimum Average Distance of Binary Codes
- 其他标题：New Bounds on the Minimum Average Distance of Binary Codes
- 本地全文：下载
- 作者：M. Basu ; S. Bagchi
- 期刊名称：Journal of Scientific Research
- 印刷版ISSN：2070-0237
- 电子版ISSN：2070-0245
- 出版年度：2010
- 卷号：2
- 期号：3
- 页码：489
- DOI：10.3329/jsr.v2i3.2708
- 语种：English
- 出版社：Rajshahi University
- 摘要：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)
- 关键词：Mathematics; Information theory.;Binary code; Hamming distance; Minimum average Hamming distance.
