List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
From MaRDI portal
Publication:398965
DOI10.1007/s10623-014-9953-5zbMath1335.94104arXiv1404.6048OpenAlexW1999418148MaRDI QIDQ398965
Antonia Wachter-Zeh, Alexander Zeh
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6048
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Decoding (94B35)
Related Items
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ On transform-domain error and erasure correction by Gabidulin 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 ⋮ Algebraic decoding of folded Gabidulin codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ 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
- 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
- Decoding of Reed Solomon codes beyond the error-correction bound
- Bounds for projective codes from semidefinite programming
- Structural attacks for public key cryptosystems based on Gabidulin codes
- A Random Linear Network Coding Approach to Multicast
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Network information flow
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Linear authentication codes: bounds and constructions
- 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
- Bounds on List Decoding of Rank-Metric Codes
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
