On List-Decodability of Random Rank Metric Codes and Subspace Codes
Codes in rank metric have a wide range of applications. To construct such codes with better list-decoding performance explicitly, it is of interest to investigate the listdecodability of random rank metric codes. It is shown that if n/m = b is a constant, then for every rank metric code in Fm×n q wi...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/82171 http://hdl.handle.net/10220/41145 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|