暂无分享,去创建一个
[1] Peter Elias,et al. List decoding for noisy channels , 1957 .
[2] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.
[3] Adam D. Smith. Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes , 2007, SODA '07.
[4] Imre Csiszár,et al. Capacity and decoding rules for classes of arbitrarily varying channels , 1989, IEEE Trans. Inf. Theory.
[5] Michael Langberg,et al. Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[6] Prakash Narayan,et al. Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.
[7] Salil P. Vadhan,et al. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.
[8] Imre Csiszár,et al. The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.
[9] Venkatesan Guruswami. List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[10] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[11] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[12] Richard J. Lipton,et al. A New Approach To Information Theory , 1994, STACS.
[13] Silvio Micali,et al. Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.
[14] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[15] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[16] Vladimir M. Blinovsky,et al. List decoding , 1992, Discrete Mathematics.
[17] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[18] V. Wei,et al. Error-Correcting Codes for List Decoding , 1994 .
[19] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[20] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[21] Venkatesan Guruswami,et al. Better Binary List Decodable Codes Via Multilevel Concatenation , 2007, IEEE Transactions on Information Theory.
[22] Moni Naor,et al. Derandomized Constructions of k-Wise (Almost) Independent Permutations , 2005, Algorithmica.
[23] Michael Langberg,et al. Oblivious Communication Channels and Their Capacity , 2008, IEEE Transactions on Information Theory.
[24] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.