Optimal p-Ary Codes from One-Weight and Two-Weight Codes over IFp＋ vIFp
Shi, Minjia, Sole, Patrick Patrick · 系统科学与复杂性：英文版 · 2015
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.