ZpZp[u]-additive codes
Abstract
In this paper, we study ZpZp[u]-additive codes, where p is prime and u2=0. In particular, we determine a Gray map from ZpZp[u] to Zp α+2 β and study generator and parity check matrices for these codes. We prove that a Gray map is a distance preserving map from (ZpZp[u],Gray distance) to (Zpα+2β,Hamming distance), it is a weight preserving map as well. Furthermore we study the structure of ZpZp[u]-additive cyclic codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.