Skip to main content
SpringerLink
Log in

An algorithm for decoding skew Reed–Solomon codes with respect to the skew metric

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

After giving a new interpretation of the skew metric defined in [8], we show that the decoding algorithm of [4] for skew Reed–Solomon codes in the Hamming metric remains valid with respect to the skew metric. This enables us to make a first step towards a list decoding algorithm in the skew metric.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Augot D.: Les codes algébriques principaux et leur décodage. Journées Nationales de Calcul Formel 1, 31–74 (2010).

    Google Scholar 

  2. Augot D., Loidreau P., Robert G.: Generalized Gabidulin codes over fields of any characteristic. Des. Codes Cryptogr. 86, 1807–1848 (2017).

    Article  MathSciNet  Google Scholar 

  3. Boucher D., Ulmer F.: A note on the dual codes of module skew codes. Comput. Sci. Cryptogr. Coding 708, 230–243 (2011).

    Article  MathSciNet  Google Scholar 

  4. Boucher D., Ulmer F.: Linear codes using skew polynomials with automorphisms and derivations. Des. Codes Cryptogr. 70(3), 405–431 (2014).

    Article  MathSciNet  Google Scholar 

  5. Gao S., Shokrollahi M.A.: Computing Roots of Polynomials Over Function Fields of Curves, Coding Theory and Cryptography (Annapolis, MD, 1998), pp. 214–228. Springer, Berlin (2000).

    MATH  Google Scholar 

  6. Gordon B., Motzkin T.S.: On the zeros of polynomials over division rings. Trans. Am. Math. Soc. 116, 218–226 (1965).

    Article  MathSciNet  Google Scholar 

  7. Lam T.Y., Leroy A.: Vandermonde and Wronskian matrices over division rings. J. Algebra 119, 308–336 (1988).

    Article  MathSciNet  Google Scholar 

  8. Martínez-Peñas U.: Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587–612 (2018).

    Article  MathSciNet  Google Scholar 

  9. Martínez-Peñas U., Kschischang F.R.: Reliable and secure multishot network coding using linearized Reed–Solomon codes. IEEE Trans. Inform. Theory 65(8), 4785–4803 (2019).

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ Rennes, CNRS, IRMAR - UMR 6625, 35000, Rennes, France

    Delphine Boucher

Authors
  1. Delphine Boucher
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Delphine Boucher.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the French government “Investissements d’Avenir” program ANR-11-LABX-0020-01.

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography 2019”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boucher, D. An algorithm for decoding skew Reed–Solomon codes with respect to the skew metric. Des. Codes Cryptogr. 88, 1991–2005 (2020). https://doi.org/10.1007/s10623-020-00789-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-020-00789-w

Keywords

Mathematics Subject Classification

Search

Navigation