加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本