Papers
Topics
Authors
Recent
Search
2000 character limit reached

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Published 29 Oct 2015 in cs.IT and math.IT | (1510.08636v1)

Abstract: In this paper, we study $\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes, where $p$ is prime and $u{2}=0$. In particular, we determine a Gray map from $ \mathbb{Z}_p\mathbb{Z}_p[u]$ to $\mathbb{Z}_p{ \alpha+2 \beta}$ and study generator and parity check matrices for these codes. We prove that a Gray map $\Phi$ is a distance preserving map from ($\mathbb{Z}_p\mathbb{Z}_p[u]$,Gray distance) to ($\mathbb{Z}_p{\alpha+2\beta}$,Hamming distance), it is a weight preserving map as well. Furthermore we study the structure of $\mathbb{Z}_p\mathbb{Z}_p[u]$-additive cyclic codes.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.