Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
From MaRDI portal
Publication:1620975
DOI10.3934/amc.2018046zbMath1402.94120OpenAlexW2844449722MaRDI QIDQ1620975
Antonia Wachter-Zeh, Hannes Bartz
Publication date: 15 November 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018046
subspace codesinterpolation-based decodingrank-metric codesprobabilistic unique decodinginterleaved Gabidulin codes
Related Items (4)
Insdel codes from subspace and rank-metric codes ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ Rank-Metric Codes and Their Applications
Cites Work
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- On transform-domain error and erasure correction by Gabidulin codes
- Row reduction applied to decoding of rank-metric and subspace codes
- Johnson type bounds on constant dimension codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for projective codes from semidefinite programming
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Optimal Ferrers Diagram Rank-Metric Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Error-Correcting Codes in Projective Space
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Bounds on List Decoding of Rank-Metric Codes
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Maximum-rank array codes and their application to crisscross error correction
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
