Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes
From MaRDI portal
Publication:6130603
DOI10.1007/s10623-023-01214-8arXiv2303.15195OpenAlexW4381592023MaRDI QIDQ6130603
Felicitas Hörmann, Hannes Bartz
Publication date: 3 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.15195
interpolation-based decodingsum-rank metricskew metricfolded linearized Reed-Solomon codesfolded skew Reed-Solomon codes
Cites Work
- Unnamed Item
- Algebraic decoding of folded Gabidulin codes
- Vandermonde and Wronskian matrices over division rings
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Pseudo linear transformations and evaluation in Ore extensions
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- Kötter interpolation in skew polynomial rings
- Linear codes using skew polynomials with automorphisms and derivations
- Powers of tensors and fast matrix multiplication
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- On Choosing and Bounding Probability Metrics
- Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
- Fundamental Properties of Sum-Rank-Metric Codes
- Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
- Generic Decoding in the Sum-Rank Metric
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Elements of Information Theory
This page was built for publication: Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes
