On a class of repeated-root monomial-like abelian codes
DOI:
https://doi.org/10.13069/jacodesmath.17537Keywords:
Repeated-root cyclic code, Abelian code, Weight-retaining propertyAbstract
In this paper we study polycyclic codes of length $p^{s_1} \times \cdots \times p^{s_n}$ over $\mathbb{F}_{p^a}$ generated by a single monomial. These codes form a special class of abelian codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. Finally we extend the results of Massey et. al. in [10] on the weight retaining property of monomials in one variable to the weight retaining property of monomials in several variables.
Received: 29 October 2014 | Accepted: 2 February 2015
Downloads
References
G. Castagnoli, J. L. Massey, P. A. Schoeller, and N. von Seemann, On repeated-root cyclic codes, IEEE Trans. Inform. Theory 37(2) (1991) 337-342.
H. Q. Dinh, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Finite Fields Appl. 14(1) (2008) 22-40.
V. Drensky and P. Lakatos, Monomial ideals, group algebras and error correcting codes, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-6), Lecture Notes in Comput. Sci. 357, Springer, Berlin (1989) 181-188.
D. M. Goldschmidt, Algebraic Functions and Projective Curves, Graduate Texts in Mathematics 215, Springer-Verlag, New York (2003).
J. W. P. Hirschfeld, G. Korchmáros, and F. Torres, Algebraic Curves over a Finite Field, Princeton Series in Applied Mathematics, Princeton University Press, Princeton, NJ (2008).
W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge (2003).
S. R. López-Permouth and S. Szabo, On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings, Adv. Math. Commun. 3(4) (2009) 409-420.
E. Martínez-Moro and I. F. Rúa, On repeated-root multivariable codes over a finite chain ring, Des. Codes Cryptogr. 45(2) (2007) 219-227.
C. Martínez-Pérez and W. Willems, On the weight hierarchy of product codes, Des. Codes Cryptogr. 33(2) (2004) 95-108.
J. L. Massey, D. J. Costello, and J. Justesen, Polynomial weights and code constructions, IEEE Trans. Inform. Theory 19(1) (1973) 101-110.
H. Özadam and F. Özbudak, A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$, Adv. Math. Commun. 3(3) (2009) 265-271.
S. R. López-Permouth, H. Özadam, F. Özbudak, and S. Szabo, Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes, Finite Fields Appl. 19(1) (2013) 16-38.
H. G. Schaathun, The weight hierarchy of product codes, IEEE Trans. Inform. Theory 46(7) (2000) 2648-2651.
J. H. van Lint, Repeated-root cyclic codes, IEEE Trans. Inform. Theory 37(2) (1991) 343-345.
