暂无分享,去创建一个
[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[2] Shlomo Hoory,et al. The Size of Bipartite Graphs with a Given Girth , 2002, J. Comb. Theory, Ser. B.
[3] 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).
[4] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[5] Peter Keevash,et al. The early evolution of the H-free process , 2009, 0908.0429.
[6] Cheng Huang,et al. On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.
[7] P. Vijay Kumar,et al. Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[8] Sriram Vishwanath,et al. Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.
[9] Dimitris S. Papailiopoulos,et al. Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.
[10] Itzhak Tamo,et al. A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.
[11] Jacques Verstraëte,et al. A counterexample to sparse removal , 2013, Eur. J. Comb..
[12] Jacques Verstraëte. Extremal problems for cycles in graphs , 2016 .
[13] Gretchen L. Matthews,et al. Locally recoverable codes from algebraic curves and surfaces , 2017, ArXiv.
[14] Chaoping Xing,et al. Optimal Locally Repairable Codes Via Elliptic Curves , 2017, IEEE Transactions on Information Theory.
[15] Lingfei Jin,et al. Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes , 2018, IEEE Transactions on Information Theory.
[16] Yuan Luo,et al. Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes , 2019, IEEE Transactions on Information Theory.
[17] Venkatesan Guruswami,et al. How Long Can Optimal Locally Repairable Codes Be? , 2019, IEEE Transactions on Information Theory.
[18] Chaoping Xing,et al. Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields , 2020, IEEE Transactions on Information Theory.