Bounds on List Decoding of Rank-Metric Codes
From MaRDI portal
Publication:5346252
DOI10.1109/TIT.2013.2274653zbMath1364.94731arXiv1301.4643MaRDI QIDQ5346252
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.4643
Related Items (17)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Non-linear maximum rank distance codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Unnamed Item ⋮ 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 ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ Unnamed Item ⋮ Linearized trinomials with maximum kernel ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Algebraic decoding of folded Gabidulin codes ⋮ Constructions of cyclic constant dimension codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Rank-Metric Codes and Their Applications ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
This page was built for publication: Bounds on List Decoding of Rank-Metric Codes
