Better extractors for better codes?
暂无分享,去创建一个
[1] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[2] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[3] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[4] Jaikumar Radhakrishnan,et al. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..
[5] C. Umans. Hardness of Approximating p 2 Minimization Problems , 1999 .
[6] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[7] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[8] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[9] Christopher Umans,et al. Hardness of approximating /spl Sigma//sub 2//sup p/ minimization problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[11] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[12] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[14] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[15] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.
[16] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[17] Amnon Ta-Shma,et al. Extractors from Reed-Muller codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Aravind Srinivasan,et al. Computing with Very Weak Random Sources , 1999, SIAM J. Comput..
[19] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[20] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[21] Venkatesan Guruswami,et al. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.
[22] C. Umans. Hardness of Approximating Minimization Problems , 1999, FOCS 1999.