Notes on linear codes over finite commutative chain rings

被引：0
作者：
Zi-hui Liu
机构：
[1] Beijing Institute of Technology,Department of Mathematics
来源：
Acta Mathematicae Applicatae Sinica, English Series | 2011年 / 27卷
关键词：
AMDS codes; weight hierarchies; finite chain rings; 94B05;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The properties of the generator matrix are given for linear codes over finite commutative chain rings, and the so-called almost-MDS (AMDS) codes are studied.
引用
收藏
页码：141 / 148
页数：7
相关论文
共 17 条
[1]  
Byrne E.(2008)Ring geometries, two-weight codes, and strongly regular graphs Des. Codes Cryptogr. 48 1-16
[2]  
Greferath M.(2004)Cyclic and negacyclic codes over finite chain rings IEEE Trans. Inform. Theory 50 1728-1744
[3]  
Honold T.(1994)The IEEE Trans. Inform. Theory 40 301-319
[4]  
Dinh H.Q.(2003)-linearity of Kerdock, Preparata, Goethals and related codes Discrete Applied Mathematics 128 263-274
[5]  
López-Permouth S.R.(1991)A Griesmer bound for linear codes over finite quasi-Frobenius rings IEEE Trans. Inform. Theory 37 1412-1418
[6]  
Hammons A.R.(1993)Generalized Hamming weight for linear codes IEEE Trans. Inform. Theory 39 1709-1713
[7]  
Kumar P.V.(1999)On the generalized Hamming weight of product codes American journal of Mathematics 121 555-575
[8]  
Calderbank A.R.(2008)Duality for modules over finite rings and applications to coding theory Proceedings of the American Mathematical Society 136 699-706
[9]  
Sloane N.J.A.(undefined)Code equivalence characterizes finite frobenius rings undefined undefined undefined-undefined
[10]  
Solé P.(undefined)undefined undefined undefined undefined-undefined
12