Trace codes over ${\mathbb{Z}}_4$ and Boolean function

Abstract

We construct trace codes over ${\mathbb{Z}}_4$ 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 ${\mathbb{Z}}_4.$