A relation between the average Hamming distance and the average Hamming weight of binary codes
文献类型:期刊论文
作者 | Zhang, ZZ |
刊名 | JOURNAL OF STATISTICAL PLANNING AND INFERENCE
![]() |
出版日期 | 2001-04-01 |
卷号 | 94期号:2页码:413-419 |
关键词 | average Hamming distance average Hamming weight cyclic code linear code permutation |
ISSN号 | 0378-3758 |
英文摘要 | An upper bound is presented for the average Hamming distance (avd) of binary codes by using the average Hamming weight (avw) of the codes. The upper bound is attained by a large class of codes. Hence, for this class of codes, a relation between the avd and the avw of a code is established. The results are applied to the avd between two codes, similar results are obtained. (C) 2001 Elsevier Science B.V. All rights reserved. |
语种 | 英语 |
WOS记录号 | WOS:000167588800027 |
出版者 | ELSEVIER SCIENCE BV |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/15880] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
作者单位 | Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Zhang, ZZ. A relation between the average Hamming distance and the average Hamming weight of binary codes[J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE,2001,94(2):413-419. |
APA | Zhang, ZZ.(2001).A relation between the average Hamming distance and the average Hamming weight of binary codes.JOURNAL OF STATISTICAL PLANNING AND INFERENCE,94(2),413-419. |
MLA | Zhang, ZZ."A relation between the average Hamming distance and the average Hamming weight of binary codes".JOURNAL OF STATISTICAL PLANNING AND INFERENCE 94.2(2001):413-419. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。