中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
On the second greedy weight for linear codes of dimension at least 4

文献类型:期刊论文

作者Chen, W; Klove, T
刊名IEEE TRANSACTIONS ON INFORMATION THEORY
出版日期2004-02-01
卷号50期号:2页码:354-356
关键词bounds constructions generalized Hamming weight greedy weight support
ISSN号0018-9448
DOI10.1109/TIT.2003.822601
英文摘要The maximum of g(2) - d(2) for linear [n, k, d; q] codes C is studied. Here d(2) is the smallest size of the support of a two-dimensional subcode of C and g(2) is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of g(2) - d(2) are given.
WOS研究方向Computer Science ; Engineering
语种英语
WOS记录号WOS:000188949100012
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/716]  
专题中国科学院数学与系统科学研究院
通讯作者Chen, W
作者单位1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Ctr Informat Secur,Lab Syst & Control, Beijing 100080, Peoples R China
2.Univ Bergen, Dept Informat, HIB, N-5020 Bergen, Norway
推荐引用方式
GB/T 7714
Chen, W,Klove, T. On the second greedy weight for linear codes of dimension at least 4[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2004,50(2):354-356.
APA Chen, W,&Klove, T.(2004).On the second greedy weight for linear codes of dimension at least 4.IEEE TRANSACTIONS ON INFORMATION THEORY,50(2),354-356.
MLA Chen, W,et al."On the second greedy weight for linear codes of dimension at least 4".IEEE TRANSACTIONS ON INFORMATION THEORY 50.2(2004):354-356.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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