Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes

DOI10.1007/s10623-018-0563-5zbMath1421.94122OpenAlexW2896508149MaRDI QIDQ1727368

Hannes Bartz, Vladimir Sidorenko

Publication date: 20 February 2019

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

Full work available at URL: https://doi.org/10.1007/s10623-018-0563-5

zbMATH Keywords

subspace codesrank-metric codesprobabilistic unique decodinginterleaved Gabidulin codessyndrome-based decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
• On transform-domain error and erasure correction by Gabidulin codes
• Probabilistic algorithm for finding roots of linearized polynomials
• Error and erasure correcting algorithms for rank codes
• Theory of codes with maximum rank distance
• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Network information flow
• Linearized Shift-Register Synthesis
• Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
• List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

This page was built for publication: Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes