QQ客服 官方微博 反馈留言

	On the minimum average distance of binary constant weight codes
	Xia, Shu-Tao ; Fu, Fang-Wei ; Jiang, Yong
	2010-05-11 ; 2010-05-11
关键词	binary constant weight codes average distance distance distribution Johnson scheme linear programming HAMMING DISTANCE SUBSETS BOUNDS CUBE Mathematics
中文摘要	Let beta(n, M, w) denote the minimum average Hamming distance of a binary constant weight code with length n, size M and weight w. In this paper, we study the problem of determining beta(n, M, w). Using the methods from coding theory and linear programming, we derive several lower bounds on the average Hamming distance of a binary constant weight code. These lower bounds enable us to determine the exact value for beta(n, M, w) in several cases. (C) 2007 Elsevier B.V. All rights reserved.
语种	英语 ; 英语
出版者	ELSEVIER SCIENCE BV ; AMSTERDAM ; PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/26383]
专题	清华大学
推荐引用方式 GB/T 7714	Xia, Shu-Tao,Fu, Fang-Wei,Jiang, Yong. On the minimum average distance of binary constant weight codes[J],2010, 2010.
APA	Xia, Shu-Tao,Fu, Fang-Wei,&Jiang, Yong.(2010).On the minimum average distance of binary constant weight codes..
MLA	Xia, Shu-Tao,et al."On the minimum average distance of binary constant weight codes".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。