Skip to main content

Extended Abstract: Codes as Modules over Skew Polynomial Rings

  • Conference paper
Codes, Cryptology, and Information Security (C2SI 2015)

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

  • 1018 Accesses

Abstract

This talk is an overview of codes that are defined as modules over skew polynomial rings. These codes can be seen as a generalization of cyclic codes or more generally polynominal codes to a non commutative polynomial ring. Most properties of classical cyclic codes can be generalized to this new setting and self-dual codes can be easily identified. Those rings are no longer unique factorization rings, therefore there are many factors of X n − 1, each generating a “skew cyclic code”. In previous works many new codes and new self-dual codes with a better distance than existing codes have been found. Recently cyclic and skew-cyclic codes over rings have been extensively studied in order to obtain codes over subfields (or subrings) under mapping with good properties.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abualrub, T., Aydin, N., Seneviratne, P.: On R-cyclic codes over F2 + vF2. Australas. J. Combin. 54, 115–126 (2012)

    MATH  MathSciNet  Google Scholar 

  2. Boucher, D., Solé, P., Ulmer, F.: Skew constacyclic codes over galois rings. Advances in Mathematics of Communications 2, 273–292 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Boucher, D., Ulmer, F.: Codes as modules over skew polynomial rings. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol. 5921, pp. 38–55. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Boucher, D., Ulmer, F.: A note on the dual codes of module skew codes. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 230–243. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Boucher, D., Ulmer, F.: Self-dual skew codes and factorization of skew polynomials. Journal of Symbolic Computation 60, 47–61 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bhaintwal, M.: Skew quasi-cyclic codes over Galois rings, Des. Codes Cryptogr. 62, 85–101 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  7. Szabo, S., Ulmer, F.: Dualilty Preserving Gray Maps (Pseudo) Self-dual Bases and Symmetric Base (preprint) (2015)

    Google Scholar 

  8. Yildiz, B., Karadeniz, S.: Linear codes over F2 + uF2 + vF2 + uvF2. Des. Codes Cryptogr. 54(1), 61–81 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Felix Ulmer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ulmer, F. (2015). Extended Abstract: Codes as Modules over Skew Polynomial Rings. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E. (eds) Codes, Cryptology, and Information Security. C2SI 2015. Lecture Notes in Computer Science(), vol 9084. Springer, Cham. https://doi.org/10.1007/978-3-319-18681-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18681-8_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18680-1

  • Online ISBN: 978-3-319-18681-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics