Optimal few-weight codes from simplicial complexes

10/10/2019

∙

by   Yansheng Wu, et al.

∙

0

∙

share

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun et al. Inspired by their work, we present two new constructions of codes over the ring F_2+u F_2 by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over F_2+u F_2. Our results show that the codes have few Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of binary distance optimal codes.