Trace codes over \Z₄ and Boolean function

2017/07/01 by Shi, Minjia, Liu, Yan, Hugues, Randriam +2
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1707.00153

Abstract

We construct trace codes over \Z₄ by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new family of optimal two-weight codes over \Z₄.

Related

• Two-weight codes from trace codes over R_k
• Two-weight and three-weight codes from trace codes over \mathbbF_p+u\mathbbF_p+v\mathbbF_p+uv\mathbbF_p
• Trace Codes with Few Weights over \mathbbF_p+u\mathbbF_p
• Two-Weight and a Few Weights Trace Codes over \mathbbF_q+u\mathbbF_q
• The Lee weight distributions of several classes of linear codes over ℤ₄