Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Rings and Algebras
2012-10-02 v1 Information Theory
math.IT
Abstract
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p^a,m) and generating sets for its ideals are considered. Along with some structure details of the ambient ring, the existance of a certain type of generating set for an ideal is proven.
Keywords
Cite
@article{arxiv.1210.0140,
title = {Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes},
author = {Sergio R. Lopez-Permouth and Hakan Ozadam and Ferruh Ozbudak and Steve Szabo},
journal= {arXiv preprint arXiv:1210.0140},
year = {2012}
}
Comments
arXiv admin note: text overlap with arXiv:0906.4008