暂无分享,去创建一个
[1] Alexander Barg,et al. Distance properties of expander codes , 2004, IEEE Transactions on Information Theory.
[2] Venkatesan Guruswami,et al. List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.
[3] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[4] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[5] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[6] Or Meir,et al. Locally Correctable and Testable Codes Approaching the Singleton Bound , 2014, Electron. Colloquium Comput. Complex..
[7] Atri Rudra,et al. Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion , 2012, STACS.
[8] D. Spielman,et al. Expander codes , 1996 .
[9] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[10] Alexander Barg,et al. Concatenated codes: serial and parallel , 2003, IEEE Transactions on Information Theory.
[11] Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
[12] Venkatesan Guruswami,et al. List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.
[13] Venkatesan Guruswami,et al. List decoding from erasures: bounds and code constructions , 2001, IEEE Trans. Inf. Theory.
[14] Atri Rudra,et al. Efficiently decodable non-adaptive group testing , 2010, SODA '10.
[15] Atri Rudra,et al. ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk , 2013, ICALP.
[16] Gilles Zémor,et al. On expander codes , 2001, IEEE Trans. Inf. Theory.
[17] Shachar Lovett,et al. Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..
[18] Rafail Ostrovsky,et al. Local Correctability of Expander Codes , 2013, ICALP.
[19] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[20] Venkatesan Guruswami,et al. Linear time encodable and list decodable codes , 2003, STOC '03.
[21] M. Murty. Ramanujan Graphs , 1965 .
[22] Noga Alon,et al. A linear time erasure-resilient code with nearly optimal recovery , 1996, IEEE Trans. Inf. Theory.
[23] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[24] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[25] Venkatesan Guruswami,et al. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.
[26] Alexander Barg,et al. Error exponents of expander codes , 2002, IEEE Trans. Inf. Theory.
[27] Moshe Morgenstern,et al. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.
[28] Venkatesan Guruswami,et al. Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) , 2004, ICALP.
[29] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[30] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.