Abstract
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since there are much more skew-cyclic codes, this new class of codes allows to systematically search for codes with good properties. We give many examples of codes which improve the previously best known linear codes.
Similar content being viewed by others
References
Bosma W., Cannon J. and Playoust C. (1997). The magma algebra system 1: the user language. J. Symb. Comp. 24: 235–265
Brouwer, A.E.: Server for bounds on the minimum distance of q-ary linear codes, q = 2,3,4,5,7,8,9. 2005. http://www.win.tue.nl/˜aeb/
Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Peredach. Inform., 21, 3–16 (1985, in Russian); pp. 1–12 in the English translation
MacWilliams F.J. and Sloane N.J.A. (1981). The Theory of Error-Correcting Codes. North-Holland, Amsterdam
McDonald B.R. (1974). Finite Rings with Identity. Marcel Dekker Inc., New York
Ore O. (1933). Theory of non-commutative polynomials. Ann. Math. 34: 480–508
Sendrier, N.: Codes correcteurs d’erreurs à haut pouvoir de correction. Thèse de doctorat, spécialité informatique, 1991. Université Paris 6
Vanstone S.A. and Oorchot P.C. (1989). An Introduction to error correcting codes with applications. Kluwer, Dordrecht
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boucher, D., Geiselmann, W. & Ulmer, F. Skew-cyclic codes. AAECC 18, 379–389 (2007). https://doi.org/10.1007/s00200-007-0043-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-007-0043-z