暂无分享,去创建一个
[1] O. Ore. Theory of Non-Commutative Polynomials , 1933 .
[2] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[3] Venkatesan Guruswami,et al. Optimal Rate List Decoding via Derivative Codes , 2011, APPROX-RANDOM.
[4] Frank R. Kschischang,et al. Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes , 2018, IEEE Transactions on Information Theory.
[5] Xiaohu Tang,et al. A Construction of Maximally Recoverable Codes With Order-Optimal Field Size , 2020, IEEE Transactions on Information Theory.
[6] Guangda Hu,et al. New constructions of SD and MR codes over small finite fields , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[7] Amir Shpilka,et al. On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.
[8] Ramprasad Saptharishi,et al. Hitting sets for multilinear read-once algebraic branching programs, in any order , 2014, STOC.
[9] Mario Blaum,et al. Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.
[10] Cheng Huang,et al. Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.
[11] Mario Blaum. Construction of PMDS and SD Codes extending RAID 5 , 2013, ArXiv.
[12] T. Lam,et al. Vandermonde and Wronskian matrices over division rings , 1988 .
[13] Minghua Chen,et al. Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).
[14] Frank R. Kschischang,et al. Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[15] Alexander Vardy,et al. Algebraic List-Decoding of Subspace Codes , 2013, IEEE Transactions on Information Theory.
[16] Venkatesan Guruswami,et al. Dimension Expanders via Rank Condensers , 2014, Electron. Colloquium Comput. Complex..
[17] Bartolomeu F. Uchôa Filho,et al. Multishot Codes for Network Coding Using Rank-Metric Codes , 2010, 2010 Third IEEE International Workshop on Wireless Network Coding.
[18] Shubhangi Saraf,et al. Maximally Recoverable Codes for Grid-like Topologies , 2016, SODA.
[19] Umberto Mart'inez-Penas,et al. A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices , 2020, SIAM J. Discret. Math..
[20] Dimitris S. Papailiopoulos,et al. XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..
[21] Felix Ulmer,et al. Linear codes using skew polynomials with automorphisms and derivations , 2012, Designs, Codes and Cryptography.
[22] Venkatesan Guruswami,et al. Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities , 2019, SODA.
[23] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[24] Umberto Martínez-Peñas,et al. Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring , 2017, Journal of Algebra.
[25] Dimitris S. Papailiopoulos,et al. Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.
[26] Éric Schost,et al. Power series solutions of singular (q)-differential equations , 2012, ISSAC.
[27] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[28] Frank R. Kschischang,et al. Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes , 2019, IEEE Transactions on Information Theory.
[29] Venkatesan Guruswami,et al. Lossless dimension expanders via linearized polynomials and subspace designs , 2018, Electron. Colloquium Comput. Complex..
[30] Dimitris S. Papailiopoulos,et al. Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.
[31] Eitan Yaakobi,et al. Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols , 2016, IEEE Transactions on Information Theory.
[32] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[33] Minghua Chen,et al. On the Maximally Recoverable Property for Multi-Protection Group Codes , 2007, 2007 IEEE International Symposium on Information Theory.
[34] Cheng Huang,et al. Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.
[35] Elwyn R. Berlekamp,et al. Algebraic Coding Theory: Revised Edition , 2015 .
[36] Venkatesan Guruswami,et al. Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields , 2018, IEEE Transactions on Information Theory.