On List-Decodability of Random Rank Metric Codes and Subspace Codes
From MaRDI portal
Publication:2978802
DOI10.1109/TIT.2014.2371915zbMATH Open1359.94844OpenAlexW2072942107MaRDI QIDQ2978802FDOQ2978802
Authors: Yang Ding 
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2014.2371915
Cited In (7)
- Properties of numeric codes for the scheme of random subspaces RSC
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- On the number of factorizations of polynomials over finite fields
- Improved list-decodability of random linear binary codes
- A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
- On the list decodability of self-orthogonal rank-metric codes
- Rank-metric codes and their applications
This page was built for publication: On List-Decodability of Random Rank Metric Codes and Subspace Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978802)
