List Decodability of Linear Subcodes of Gabidulin Codes

[1]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discret. Math..

[2]  Antonia Wachter-Zeh.  Bounds on List Decoding Gabidulin Codes , 2012, ArXiv.

[3]  Maximilien Gadouleau,et al.  Packing and Covering Properties of Rank Metric Codes , 2007, IEEE Transactions on Information Theory.

[4]  Venkatesan Guruswami,et al.  On the List-Decodability of Random Linear Codes , 2010, IEEE Transactions on Information Theory.

[5]  Venkatesan Guruswami,et al.  Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs , 2016, IEEE Transactions on Information Theory.

[6]  Antonia Wachter-Zeh,et al.  Bounds on List Decoding of Rank-Metric Codes , 2013, IEEE Transactions on Information Theory.

[7]  Yang Ding,et al.  On List-Decodability of Random Rank Metric Codes and Subspace Codes , 2014, IEEE Transactions on Information Theory.

[8]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[9]  Shu Liu,et al.  List Decodability of Random Subcodes of Gabidulin Codes , 2017, IEEE Transactions on Information Theory.

[10]  Martin Bossert,et al.  Maximum rank distance codes as space-time codes , 2003, IEEE Trans. Inf. Theory.

[11]  Shu Liu,et al.  On the List Decodability of Self-orthogonal Rank Metric Codes , 2018, Finite Fields Their Appl..

[12]  Peter Elias,et al.  Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[13]  Venkatesan Guruswami,et al.  On the List-Decodability of Random Linear Rank-Metric Codes , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).

[14]  Venkatesan Guruswami,et al.  List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.

[15]  Antonia Wachter-Zeh,et al.  Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius , 2016, IEEE Transactions on Information Theory.