Abstract
In this notice we describe the ideal structure of all cases of cyclic and negacyclic codes of length p s over a Galois ring alphabet that have not yet been discussed in the literature. Unlike in the cases reported earlier in the literature by various authors, the ambient spaces here are never chain rings. These ambient rings do nonetheless share the properties of being local and having a simple socle.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Calderbank, A.R., Sloane, N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6(1), 21–35 (1995)
Kanwar, P., López-Permouth, S.R.: Cyclic codes over the integers modulo \(p\sp m\). Finite Fields Appl. 3(4), 334–352 (1997)
Kiah, H.M., Leung, K.H., Ling, S.: Cyclic codes over \({\rm GR}(p\sp 2,m)\) of length \(p\sp k\). Finite Fields Appl 14(3), 834–846 (2008)
Pless, V.S., Qian, Z.: Cyclic codes and quadratic residue codes over \(Z\sb 4\). IEEE Trans. Inform. Theory 42(5), 1594–1600 (1996)
Sălăgean, A.: Repeated-root cyclic and negacyclic codes over a finite chain ring. Discrete Appl. Math. 154(2), 413–419 (2006)
Wolfmann, J.: Negacyclic and cyclic codes over \(Z\sb 4\). IEEE Trans. Inform. Theory 45(7), 2527–2532 (1999)
Abualrub, T., Oehmke, R.: Cyclic codes of length \(2\sp e\) over \(Z\sb 4\). Discrete Appl. Math. 128(1), 3–9 (2003); International Workshop on Coding and Cryptography (WCC 2001), Paris (2001)
Abualrub, T., Oehmke, R.: On the generators of \(\Bbb Z\sb 4\) cyclic codes of length \(2\sp e\). IEEE Trans. Inform. Theory 49(9), 2126–2133 (2003)
Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inform. Theory 37(2), 337–342 (1991)
Dougherty, S.T., Park, Y.H.: On modular cyclic codes. Finite Fields Appl. 13(1), 31–57 (2007)
Özadam, H., Özbudak, F.: A note on negacyclic and cyclic codes of length p s over a finite field of characteristic p (2009) (preprint)
van Lint, J.H.: Repeated-root cyclic codes. IEEE Trans. Inform. Theory 37(2), 343–345 (1991)
López-Permouth, S.R., Szabo, S.: On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. arXiv:0903.2791v1 (submitted)
Dinh, H.Q.: Negacyclic codes of length \(2\sp s\) over Galois rings. IEEE Trans. Inform. Theory 51(12), 4252–4262 (2005)
Lam, T.Y.: A first course in noncommutative rings, 2nd edn. Graduate Texts in Mathematics, vol. 131. Springer, New York (2001)
McDonald, B.R.: Finite rings with identity. Pure and Applied Mathematics, vol. 28. Marcel Dekker Inc., New York (1974)
López-Permouth, S.R., Szabo, S.: Polynomial codes over Galois rings (in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Permouth, S.R., Szabo, S. (2009). Repeated Root Cyclic and Negacyclic Codes over Galois Rings. In: Bras-Amorós, M., Høholdt, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2009. Lecture Notes in Computer Science, vol 5527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02181-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-02181-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02180-0
Online ISBN: 978-3-642-02181-7
eBook Packages: Computer ScienceComputer Science (R0)