Skip to main content

Codes as Modules over Skew Polynomial Rings

  • Conference paper
Cryptography and Coding (IMACC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5921))

Included in the following conference series:

Abstract

In previous works we considered codes defined as ideals of quotients of skew polynomial rings, so called Ore rings of automorphism type. In this paper we consider codes defined as modules over skew polynomial rings, removing therefore some of the constraints on the length of the skew codes defined as ideals. The notion of BCH codes can be extended to this new approach and the skew codes whose duals are also defined as modules can be characterized. We conjecture that self-dual skew codes defined as modules must be constacyclic and prove this conjecture for the Hermitian scalar product and under some assumptions for the Euclidean scalar product. We found new [56, 28, 15], [60,30,16], [62,31,17], [66,33,17] Euclidean self-dual skew codes and new [50,25,14], [58,29,16] Hermitian self-dual skew codes over F 4, improving the best known distances for self-dual codes of these lengths over F 4.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berrick, A., Keating, M.: An introduction to rings and modules. Cambridge Studies in Advanced Mathematics, vol. 65. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  2. Bosma, W., Cannon, J., Playoust, C.: The magma algebra system i: The user language. Journal of Symbolic Computation 24, 235–265 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Boucher, D., Geiselmann, W., Ulmer, F.: Skew Cyclic Codes, Applied Algebra in Engineering. Communication and Computing 18, 379–389 (2007)

    MATH  MathSciNet  Google Scholar 

  4. Boucher, D., Solé, P., Ulmer, F.: Skew Constacyclic Codes over Galois Rings. Advances in Mathematics of Communications 2, 273–292 (2008)

    Article  MathSciNet  Google Scholar 

  5. Boucher, D., Ulmer, F.: Coding with skew polynomial rings. Journal of Symbolic Computation 44, 1644–1656 (2009)

    Article  MATH  Google Scholar 

  6. Chaussade, L., Loidreau, P., Ulmer, F.: Skew codes of prescribed distance or rank. Designs, Codes and Cryptography 50(3), 267–284 (2009)

    Article  MathSciNet  Google Scholar 

  7. Gaborit, P., Otmani, A.: Tables of Euclidean and Hermitian self-dual codes over GF(4) (2002), http://www.unilim.fr/pages_perso/philippe.gaborit/SD/

  8. Jacobson, N.: The theory of rings. Publication of the AMS (1943)

    Google Scholar 

  9. McDonald, B.R.: Finite Rings with Identity. Marcel Dekker Inc., New York (1974)

    MATH  Google Scholar 

  10. Ore, O.: Theory of non-commutative polynomials. Ann. of Math. 34 (1933)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boucher, D., Ulmer, F. (2009). Codes as Modules over Skew Polynomial Rings. In: Parker, M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10868-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10868-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10867-9

  • Online ISBN: 978-3-642-10868-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics