List Decoding: Algorithms and Applications
暂无分享,去创建一个
[1] Russell Impagliazzo,et al. Hard-core distributions for somewhat hard problems , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[2] Ronitt Rubinfeld,et al. Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..
[3] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[4] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[5] Jin-Yi Cai,et al. On the Hardness of Permanent , 1999, STACS.
[6] Ronitt Rubinfeld,et al. Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[7] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[8] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.
[9] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[10] D. Sivakumar. On Membership Comparable Sets , 1999, J. Comput. Syst. Sci..
[11] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] Venkatesan Guruswami,et al. "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[13] Richard J. Lipton,et al. Computing from partial solutions , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[14] Erich Kaltofen,et al. Polynomial Factorization 1987-1991 , 1992, LATIN.
[15] Avi Wigderson,et al. Near-optimal conversion of hardness into pseudo-randomness , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[16] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[17] Noam Nisan,et al. BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[18] Dana Ron,et al. Chinese remaindering with errors , 1999, STOC '99.
[19] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[20] Peter Elias,et al. List decoding for noisy channels , 1957 .
[21] Ravi Kumar,et al. Proofs, codes, and polynomial-time reducibilities , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[22] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[23] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[24] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[25] Dan Boneh,et al. Finding smooth integers in short intervals using CRT decoding , 2000, STOC '00.
[26] Oded Goldreich,et al. RSA and Rabin Functions: Certain Parts are as Hard as the Whole , 1988, SIAM J. Comput..
[27] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[28] Amin Shokrollahi,et al. List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.