Two-weight codes from trace codes over
arXiv:1612.05523
Abstract
We construct a family of two-Lee-weight codes over the ring which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain optimal abelian binary two-weight codes by using the Griesmer bound. An application to secret sharing schemes is also given.