A relation between the average Hamming distance and the average Hamming weight of binary codes

CSpace

	A relation between the average Hamming distance and the average Hamming weight of binary codes
	Zhang, ZZ
	2001-04-01
发表期刊	JOURNAL OF STATISTICAL PLANNING AND INFERENCE
ISSN	0378-3758
卷号	94 期号:2 页码:413-419
摘要	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.
关键词	average Hamming distance average Hamming weight cyclic code linear code permutation
语种	英语
WOS研究方向	Mathematics
WOS类目	Statistics & Probability
WOS记录号	WOS:000167588800027
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/15881
专题	中国科学院数学与系统科学研究院
作者单位	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.