Algebraic decoding of folded Gabidulin codes

DOI10.1007/s10623-016-0195-6zbMath1402.94119OpenAlexW2331086348MaRDI QIDQ510495

Hannes Bartz, Vladimir Sidorenko

Publication date: 10 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10623-016-0195-6

zbMATH Keywords

interpolation-based decodingrank-metric codesfolded Gabidulin codesprobabilistic unique decoding

Mathematics Subject Classification ID

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

Related Items (3)

Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Rank-Metric Codes and Their Applications

Cites Work

• Unnamed Item
• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• List decoding subspace codes from insertions and deletions
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Packing and Covering Properties of Rank Metric Codes
• Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
• Bounds on List Decoding of Rank-Metric Codes
• List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

This page was built for publication: Algebraic decoding of folded Gabidulin codes