Few-weight codes over associated with down sets and their distance optimal Gray image
arXiv:1910.07668
Abstract
Let be an odd prime number. In this paper, we construct classes of codes over the ring , which are associated with down sets. We compute the Lee weight distributions of the classes of codes when the down sets are generated by a single maximal element. Moreover, by using the Gray map of the linear codes over , we find out classes of -ary distance optimal linear codes. Two of them meet the Griesmer bound.
13 pages. To appear in Discrete Applied Mathematics