Abstract
In this paper, we study -additive codes, where is prime and . In particular, we determine a Gray map from to and study generator and parity check matrices for these codes. We prove that a Gray map is a distance preserving map from (,Gray distance) to (,Hamming distance), it is a weight preserving map as well. Furthermore we study the structure of -additive cyclic codes.
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.