Efficient error-correcting codes for sliding windows

Ran Gelles, Rafail Ostrovsky, Alan Roytman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationSOFSEM 2014
Subtitle of host publicationTheory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages258-268
Number of pages11
ISBN (Print)9783319042978
DOIs
StatePublished - 2014
Externally publishedYes
Event40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014 - Novy Smokovec, Slovakia
Duration: 26 Jan 201429 Jan 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8327 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014
Country/TerritorySlovakia
CityNovy Smokovec
Period26/01/1429/01/14

Fingerprint

Dive into the research topics of 'Efficient error-correcting codes for sliding windows'. Together they form a unique fingerprint.

Cite this