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

DOI10.1007/S10623-020-00789-WzbMATH Open1446.94175OpenAlexW3063923897MaRDI QIDQ2200525FDOQ2200525

Delphine Boucher

Publication date: 22 September 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00789-w

Recommendations

• Linear codes using skew polynomials with automorphisms and derivations
• Peterson-Gorenstein-Zierler algorithm for skew RS codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Row reduction applied to decoding of rank-metric and subspace codes

zbMATH Keywords

skew polynomial ringserror-correcting codesdecoding

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear codes (general theory) (94B05) Decoding (94B35)

Cites Work

• A Note on the Dual Codes of Module Skew Codes
• Vandermonde and Wronskian matrices over division rings
• Linear codes using skew polynomials with automorphisms and derivations
• Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
• On the Zeros of Polynomials over Division Rings
• Title not available (Why is that?)
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Generalized Gabidulin codes over fields of any characteristic

Cited In (7)

• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Skew Reed-Muller codes
• A first step towards the skew duadic codes
• Codes in the Sum-Rank Metric: Fundamentals and Applications
• A complete, nonredundant algorithm for reversed Skolemization
• Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
• Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes

This page was built for publication: An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200525)