On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
From MaRDI portal
Publication:398944
DOI10.1007/s10623-014-9932-xzbMath1335.94022arXiv1309.0403OpenAlexW3103406970MaRDI QIDQ398944
Natalia Silberstein, Joachim Rosenthal, Anna-Lena Trautmann
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/1309.0403
Circuits, networks (94C99) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35) Source coding (94A29)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Algebraic codes for network coding
- Large constant dimension codes and lexicodes
- List decoding subspace codes from insertions and deletions
- Codes and Designs Related to Lifted MRD Codes
- Schubert Calculus
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Error-Correcting Codes in Projective Space
- Enumerative Coding for Grassmannian Space
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Bounds on List Decoding of Rank-Metric Codes
- Cyclic Orbit Codes
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
