CORC  > 清华大学
The characterization of binary constant weight codes meeting the bound of Fu and Shen
Fu, Fang-Wei ; Xia, Shu-Tho
2010-05-11 ; 2010-05-11
关键词binary codes binary constant weight codes Grey-Rankin bound distance distribution quasi-symmetric designs QUASI-SYMMETRICAL DESIGNS Computer Science, Theory & Methods Mathematics, Applied
中文摘要Fu and Shen gave an upper bound on binary constant weight codes. In this paper, we present a new proof for the bound of Fu and Shen and characterize binary constant weight codes meeting this bound. It is shown that binary constant weight codes meet the bound of Fu and Shen if and only if they are generated from certain symmetric designs and quasi-symmetric designs in combinatorial design theory. In particular, it turns out that the existence of binary codes with even length meeting the Grey-Rankin bound is equivalent to the existence of certain binary constant weight codes meeting the bound of Fu and Shen. Furthermore, some examples are listed to illustrate these results. Finally, we obtain a new upper bound on binary constant weight codes which improves on the bound of Fu and Shen in certain case.
语种英语 ; 英语
出版者SPRINGER ; DORDRECHT ; VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/26309]  
专题清华大学
推荐引用方式
GB/T 7714
Fu, Fang-Wei,Xia, Shu-Tho. The characterization of binary constant weight codes meeting the bound of Fu and Shen[J],2010, 2010.
APA Fu, Fang-Wei,&Xia, Shu-Tho.(2010).The characterization of binary constant weight codes meeting the bound of Fu and Shen..
MLA Fu, Fang-Wei,et al."The characterization of binary constant weight codes meeting the bound of Fu and Shen".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace