暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.
[2] Alexander Vardy,et al. Algebraic list-decoding on the operator channel , 2010, 2010 IEEE International Symposium on Information Theory.
[3] Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
[4] Martin Bossert,et al. Maximum rank distance codes as space-time codes , 2003, IEEE Trans. Inf. Theory.
[5] Erich Kaltofen,et al. Polynomial Factorization 1987-1991 , 1992, LATIN.
[6] Ernst M. Gabidulin,et al. Ideals over a Non-Commutative Ring and thier Applications in Cryptology , 1991, EUROCRYPT.
[7] Frank R. Kschischang,et al. A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[8] Venkatesan Guruswami,et al. List decoding subspace codes from insertions and deletions , 2012, ITCS '12.
[9] Shachar Lovett,et al. Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..
[10] Pierre Loidreau. Designing a Rank Metric Based McEliece Cryptosystem , 2010, PQCrypto.
[11] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[12] Ron M. Roth,et al. Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.
[13] Amir Shpilka,et al. On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.
[14] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[15] Antonia Wachter-Zeh,et al. Bounds on List Decoding of Rank-Metric Codes , 2013, IEEE Transactions on Information Theory.
[16] Alexander Vardy,et al. Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.
[17] Ernst M. Gabidulin. A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes , 1991, Algebraic Coding.
[18] Natalia Silberstein,et al. Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams , 2008, IEEE Transactions on Information Theory.
[19] P. Vijay Kumar,et al. A unified construction of space-time codes with optimal rate-diversity tradeoff , 2005, IEEE Transactions on Information Theory.
[20] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[21] Hessam Mahdavifar. List-decoding of subspace codes and rank-metric codes up to Singleton bound , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[22] ChallengesPaul ZimmermannInria Lorrainezimmermann. Polynomial Factorization , 1996 .
[23] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.