Abstract
In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gabidulin codes, we introduce new notions of evaluation of skew polynomials with derivations and the corresponding evaluation codes. We propose several approaches to generalize Reed-Solomon and BCH codes to module skew codes and for two classes we show that the dual of such a Reed-Solomon type skew code is an evaluation skew code. We generalize a decoding algorithm due to Gabidulin for the rank metric and derive families of Maximum Distance Separable and Maximum Rank Distance codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berger T.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inf. Theory 49(11), 3016–3019 (2003)
Boucher D., Ulmer F.: Coding with skew polynomial rings. J. Symb. Comput. 44, 1644–1656 (2009)
Boucher D., Ulmer F.: Codes as modules over skew polynomial rings. In: Proceedings of the 12th IMA Conference on Cryptography and Coding, Cirencester. Lecture Notes in Computer Science, vol. 5921, pp. 38–55 (2009).
Boucher D., Geiselmann W., Ulmer F.: Skew cyclic codes. applied algebra in engineering. Commun. Comput. 18(4), 379–389 (2007)
Bronstein M., Petkovshek M.: Ore rings, linear operators and factorization. Rossiĭ skaya Akademiya Nauk. Programmirovanie 1, 27–44 (1994)
Chaussade L.: Codes correcteurs avec les polynômes tordus, Thèse Université de Rennes 1, novembre (2010).
Chaussade L., Loidreau P., Ulmer F.: Skew codes of prescribed distance or rank. Des. Codes Cryptogr. 50(3), 267–284 (2009)
Cohn P.M.: Free Rings and Their Relations. London Mathematical Society (1971).
Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Peredach. Inf. 21, 3–16 (1985) (in Russian; pp. 1–12 in the English translation).
Gabidulin E.M.: A fast matrix decoding algorithm for rank-error-correcting codes. Lecture Notes in Computer Science, vol. 573, pp. 126–133. Springer (1991).
Lam T.Y.: A general theory of Vandermonde matrices. Expositiones Mathematicae 4, 193–215 (1986)
Lam T.Y., Leroy A.: Vandermonde and Wronskian matrices over division rings. J. Algebra 119, 308–336 (1988)
Lidl R., Niederreiter H.: Finite Fields., Encyclopedia of Mathematics and its Applications, vol. 20. Addison-Wesley, Amsterdam (1956).
Loidreau P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. Lecture Notes in Computer Science, vol. 3969, 36–45 (2006)
Ore O.: Theory of Non-Commutative Polynomials. Ann. Math., 2nd Ser, 34(3), 480–508 (1933).
Ore O.: On a special class of polynomials. Trans. Am. Math. Soc. 35, 559–584 (1933)
Van Lint J.H.: Introduction to coding theory. Graduate Texts in Mathematics, vol. 86. Springer-Verlag (1999).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Penttila.
Rights and permissions
About this article
Cite this article
Boucher, D., Ulmer, F. Linear codes using skew polynomials with automorphisms and derivations. Des. Codes Cryptogr. 70, 405–431 (2014). https://doi.org/10.1007/s10623-012-9704-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9704-4