Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes (1510.08636v1)

Published 29 Oct 2015 in cs.IT and math.IT

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

We haven't generated a summary for this paper yet.