Abstract
We consider the task of transmitting a data stream in the sliding window model, where communication takes place over an adversarial noisy channel with noise rate up to 1. For any noise level c < 1 we design an efficient encoding scheme, such that for any window in which the noise level does not exceed c, the receiving end decodes at least a (1 − c − ε)-prefix of the window, for any small ε > 0. Decoding more than a (1 − c)-prefix of the window is shown to be impossible in the worst case, which makes our scheme optimal in this sense. Our scheme runs in polylogarithmic time per element in the size of the window, causes constant communication overhead, and succeeds with overwhelming probability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Franklin, M., Gelles, R., Ostrovsky, R., Schulman, L.J.: Optimal coding for streaming authentication and interactive communication. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 258–276. Springer, Heidelberg (2013)
Gelles, R., Moitra, A., Sahai, A.: Efficient and explicit coding for interactive communication. In: FOCS 2011, pp. 768–777 (2011)
Guruswami, V., Indyk, P.: Linear-time encodable/decodable codes with near-optimal rate. IEEE Trans.@ on Information Theory 51(10), 3393–3400 (2005)
Guruswami, V., Smith, A.: Codes for computationally simple channels: Explicit constructions with optimal rate. In: FOCS 2010, pp. 723–732 (2010)
Kienzler, R., Bruggmann, R., Ranganathan, A., Tatbul, N.: Large-scale DNA sequence analysis in the cloud: a stream-based approach. In: Alexander, M., et al. (eds.) Euro-Par 2011, Part II. LNCS, vol. 7156, pp. 467–476. Springer, Heidelberg (2012)
Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: FOCS 2004, pp. 325–334. IEEE Computer Society, Washington, DC (2004)
Lipton, R.: A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 699–708. Springer, Heidelberg (1994)
Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction against computationally bounded noise. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 1–16. Springer, Heidelberg (2005)
Munir, S., Lin, S., Hoque, E., Nirjon, S., Stankovic, J., Whitehouse, K.: Addressing burstiness for reliable communication and latency bound generation in wireless sensor networks. In: IPSN 2010, pp. 303–314 (2010)
Schulman, L.J.: Deterministic coding for interactive communication. In: STOC 1993, pp. 747–756 (1993)
Schulman, L.J.: Coding for interactive communication. IEEE Transactions on Information Theory 42(6), 1745–1756 (1996)
Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review 5(1), 3–55 (2001), originally appeared in Bell System Tech. J. 27, 379–423, 623–656 (1948)
Shannon, C.E.: A note on a partial ordering for communication channels. Information and Control 1(4), 390–397 (1958)
Smith, A.: Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. In: SODA 2007, pp. 395–404 (2007)
Spielman, D.: Computationally efficient error-correcting codes and holographic proofs. Ph.D. thesis, Massachusetts Institute of Technology (1995)
Spielman, D.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory 42(6), 1723–1731 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gelles, R., Ostrovsky, R., Roytman, A. (2014). Efficient Error-Correcting Codes for Sliding Windows. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham. https://doi.org/10.1007/978-3-319-04298-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-04298-5_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04297-8
Online ISBN: 978-3-319-04298-5
eBook Packages: Computer ScienceComputer Science (R0)