Error and erasure correcting algorithms for rank codes

DOI10.1007/s10623-008-9185-7zbMath1178.94223OpenAlexW2057174629MaRDI QIDQ1009077

Nina I. Pilipchuk, Ernst M. Gabidulin

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-008-9185-7

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (9)

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Information security in a random network coding network ⋮ Product Construction of Affine Codes ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Decoding of random network codes ⋮ Rank-Metric Codes and Their Applications

Cites Work

• Theory of codes with maximum rank distance
• Symmetric rank codes
• Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
• Maximum-rank array codes and their application to crisscross error correction
• Coding and Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Error and erasure correcting algorithms for rank codes