An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
From MaRDI portal
(Redirected from Publication:2200525)
Recommendations
Cites work
- scientific article; zbMATH DE number 1488179 (Why is no real title available?)
- A note on the dual codes of module skew codes
- Generalized Gabidulin codes over fields of any characteristic
- Linear codes using skew polynomials with automorphisms and derivations
- On the Zeros of Polynomials over Division Rings
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Vandermonde and Wronskian matrices over division rings
Cited in
(9)- Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Skew Reed-Muller codes
- A first step towards the skew duadic codes
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
- Codes in the sum-rank metric: fundamentals and applications
- A complete, nonredundant algorithm for reversed Skolemization
- Peterson-Gorenstein-Zierler algorithm for skew RS codes
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
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)