Optimal Rate Code Constructions for Computationally Simple Channels
暂无分享,去创建一个
[1] Michael Langberg,et al. Oblivious Communication Channels and Their Capacity , 2008, IEEE Transactions on Information Theory.
[2] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[3] Rafail Ostrovsky,et al. Public-Key Locally-Decodable Codes , 2008, CRYPTO.
[4] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[5] Adam D. Smith. Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes , 2007, SODA '07.
[6] Michael Langberg,et al. Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[7] Prakash Narayan,et al. Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.
[8] Michael Langberg,et al. Codes against online adversaries , 2008, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[9] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[10] R. Ahlswede. Elimination of correlation in random codes for arbitrarily varying channels , 1978 .
[11] Richard J. Lipton,et al. A New Approach To Information Theory , 1994, STACS.
[12] Rafail Ostrovsky,et al. Private Locally Decodable Codes , 2007, ICALP.
[13] Silvio Micali,et al. Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.
[14] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[15] Michael Langberg,et al. Beating the Gilbert-Varshamov bound for online channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[16] Imre Csiszár,et al. The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.
[17] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[18] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[19] Moni Naor,et al. Derandomized Constructions of k-Wise (Almost) Independent Permutations , 2005, Algorithmica.
[20] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[21] Salil P. Vadhan,et al. Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.
[22] Venkatesan Guruswami. List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[23] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[24] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[25] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[26] Michael Langberg,et al. Binary causal-adversary channels , 2009, 2009 IEEE International Symposium on Information Theory.
[27] Imre Csiszár,et al. Capacity and decoding rules for classes of arbitrarily varying channels , 1989, IEEE Trans. Inf. Theory.
[28] Imre Csiszár,et al. Arbitrarily varying channels with constrained inputs and states , 1988, IEEE Trans. Inf. Theory.
[29] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[30] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[31] Dan Suciu,et al. Journal of the ACM , 2006 .
[32] Mihir Bellare,et al. Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[33] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[34] Vladimir M. Blinovsky,et al. List decoding , 1992, Discrete Mathematics.
[35] Peter Elias,et al. List decoding for noisy channels , 1957 .
[36] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.
[37] Peter Elias,et al. Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.
[38] Michael Langberg,et al. A Characterization of the Capacity of Online (causal) Binary Channels , 2014, STOC.
[39] Anand D. Sarwate,et al. Improved upper bounds on the capacity of binary channels with causal adversaries , 2012, ISIT.
[40] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..