Paper Info
Title
The Gray Map on GR(p2, n) and Repeated-Root Cyclic Codes
Abstract
It is shown that the Gray map on \mathbbZnp2\mathbb{Z}^n_{p^2}, where p is a prime and n a positive integer, yields the same result as an appropriate extension of the well-known “(u|u+v)-construction”. It is also shown that, up to a permutation, which is a generalization of Nechaev’s permutation, the Gray image of certain \mathbbZp2\mathbb{Z}_{p^2}-codes of length n constructed from \mathbbFp\mathbb{F}_p-cyclic codes of length n are \mathbbFp\mathbb{F}_p-cyclic codes of length pn with multiple roots. These results generalize some of those appearing in [21]. Examples are given in order to illustrate the ideas.
Year
DOI
Venue
2003
10.1007/978-3-540-24633-6_15
International Conference on Finite Fields and Applications
Field
DocType
Citations 
Prime (order theory),Integer,Discrete mathematics,Combinatorics,Permutation,Gray map,Cyclic code,Cyclic permutation,Mathematics
Conference
0
PageRank 
References 
Authors
0.34
10
1
Name
Order
Citations
PageRank
Horacio Tapia-Recillas1326.12