On transform-domain error and erasure correction by Gabidulin codes
From MaRDI portal
Publication:398969
DOI10.1007/s10623-014-9954-4zbMath1335.94097OpenAlexW2047496568MaRDI QIDQ398969
Vladimir Sidorenko, Danilo Silva, Wen-Hui Li
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9954-4
Linear codes (general theory) (94B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Decoding (94B35)
Related Items (6)
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Fast operations on linearized polynomials and their applications in coding theory ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Rank-Metric Codes and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Error and erasure correcting algorithms for rank codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Theory of non-commutative polynomials
- Fast decoding of Gabidulin codes
- Fast skew-feedback shift-register synthesis
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Linearized Shift-Register Synthesis
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: On transform-domain error and erasure correction by Gabidulin codes
