Abstract
This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over ℤ4. The authors first give the Pless identities on the Lee weight of linear codes over ℤ4. Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively, the construction methods of one-Lee weight and two-Lee weight projective codes over ℤ4 are also given. Finally, the authors recall the weight-preserving Gray map from (ℤ 4 , Lee weight) to ( $\mathbb{F}_2^{2n} $ , Hamming weight), and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes, which reach the Plotkin bound and the Griesmer bound.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
