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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.