On the second greedy weight for linear codes of dimension at least 4

doi:10.1109/TIT.2003.822601

CSpace

	On the second greedy weight for linear codes of dimension at least 4
	Chen, W ; Klove, T
	2004-02-01
发表期刊	IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN	0018-9448
卷号	50 期号:2 页码:354-356
摘要	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.
关键词	bounds constructions generalized Hamming weight greedy weight support
DOI	10.1109/TIT.2003.822601
语种	英语
WOS研究方向	Computer Science ; Engineering
WOS类目	Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS记录号	WOS:000188949100012
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/717
专题	中国科学院数学与系统科学研究院
通讯作者	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.