Fast Algorithms for Interactive Coding
暂无分享,去创建一个
[1] Mark Braverman,et al. Towards deterministic tree code constructions , 2012, ITCS '12.
[2] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[4] Amit Sahai,et al. Efficient Coding for Interactive Communication , 2014, IEEE Transactions on Information Theory.
[5] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[6] M. Chiani. Error Detecting and Error Correcting Codes , 2012 .
[7] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[8] Amit Sahai,et al. Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[9] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[10] Yael Tauman Kalai,et al. Efficient Interactive Coding against Adversarial Noise , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[11] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[12] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[13] Amit Sahai,et al. Potent Tree Codes and their applications: Coding for Interactive Communication, revisited , 2011, ArXiv.
[14] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[15] Mihir Bellare,et al. Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.
[16] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[17] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[18] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[19] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[20] Mark Braverman,et al. Toward Coding for Maximum Errors in Interactive Communication , 2011, IEEE Transactions on Information Theory.