$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes
Information Theory
2015-10-30 v1 math.IT
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.
Keywords
Cite
@article{arxiv.1510.08636,
title = {$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes},
author = {Zhenliang Lu and Shixin Zhu},
journal= {arXiv preprint arXiv:1510.08636},
year = {2015}
}