nach oben

Designs, Codes and Cryptography

Erschienen in:

20.08.2020

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

verfasst von: Delphine Boucher

Erschienen in: Designs, Codes and Cryptography | Ausgabe 9/2020

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel Boomerang uniformity of popular S-box constructions

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

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

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

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

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

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

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

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).MathSciNetCrossRef

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).MathSciNetCrossRef

10.

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

Titel: An algorithm for decoding skew Reed–Solomon codes with respect to the skew metric
verfasst von: Delphine Boucher
Publikationsdatum: 20.08.2020
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 9/2020
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-020-00789-w

Springer Professional

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

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 9/2020

Cryptanalysis of a code-based one-time signature

Boomerang uniformity of popular S-box constructions

Codes with locality from cyclic extensions of Deligne–Lusztig curves

On the security of a Loidreau rank metric code based encryption scheme

The geometric approach to the existence of some quaternary Griesmer codes

Counting Boolean functions with faster points

Premium Partner