Optimal p-Ary Codes from One-Weight and Two-Weight Codes over IF_p+ vIF_p

作     者：SHI Minjia SOL Patrick 

作者机构：School of Mathematical Sciences Anhui University Telecom Paris Tech 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2015年第28卷第3期

页      面：679-690页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 081705[工学-工业催化] 08[工学] 0817[工学-化学工程与技术] 110505[军事学-密码学] 

基　　金：supported by the National Natural Science Foundation of China under Grant No.61202068 Talented youth Fund of Anhui Province Universities under Grant No.2012SQRL020ZD the Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Personnel of China under Grant No.05015133 

主　　题：Generator matrix Gray map linear code one-Lee weight code two-Lee weight code. 

摘      要：This paper is devoted to determining the structures and properties of one-Lee weight codes and two-Lee weight projective codes Ck1,k2,k3 over p IF+ v IFp with type p2k1pk2pk3. The authors introduce a distance-preserving Gray map from( IFp + v IFp)nto2np. By the Gray map, the authors construct a family of optimal one-Hamming weight p-ary linear codes from one-Lee weight codes over IFp+ v IFp, which attain the Plotkin bound and the Griesmer bound. The authors also obtain a class of optimal p-ary linear codes from two-Lee weight projective codes over IFp + vIFp, which meet the Griesmer bound.