Efficient Error-Correcting Codes for Sliding Windows
暂无分享,去创建一个
[1] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[2] D. Spielman,et al. Computationally efficient error-correcting codes and holographic proofs , 1995 .
[3] Rafail Ostrovsky,et al. Optimal Coding for Streaming Authentication and Interactive Communication , 2015, IEEE Transactions on Information Theory.
[4] Richard J. Lipton,et al. A New Approach To Information Theory , 1994, STACS.
[5] Adam D. Smith. Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes , 2007, SODA '07.
[6] Silvio Micali,et al. Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.
[7] Venkatesan Guruswami,et al. Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[8] Michael Langberg,et al. Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[9] Claude E. Shannon,et al. A Note on a Partial Ordering for Communication Channels , 1958, Information and Control.
[10] Yehuda Lindell,et al. More Efficient Constant-Round Multi-Party Computation from BMR and SHE , 2016, IACR Cryptol. ePrint Arch..
[11] Ran Canetti,et al. Advances in Cryptology – CRYPTO 2013 , 2013, Lecture Notes in Computer Science.
[12] Amit Sahai,et al. Efficient and Explicit Coding for Interactive Communication , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[13] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[14] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[15] Claude E. Shannon,et al. The mathematical theory of communication , 1950 .
[16] Mario Cannataro,et al. Euro-Par 2011: Parallel Processing Workshops , 2011, Lecture Notes in Computer Science.
[17] Sirajum Munir,et al. Addressing burstiness for reliable communication and latency bound generation in wireless sensor networks , 2010, IPSN '10.
[18] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[19] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[20] Nesime Tatbul,et al. Large-Scale DNA Sequence Analysis in the Cloud: A Stream-Based Approach , 2011, Euro-Par Workshops.