Efficient Error-Correcting Codes for Sliding Windows
From MaRDI portal
Publication:5220468
DOI10.1137/18M1235703zbMath1460.68037OpenAlexW4243943764MaRDI QIDQ5220468
Rafail Ostrovsky, Ran Gelles, Alan Roytman
Publication date: 26 March 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1235703
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- An improvement of the tree code construction
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Towards deterministic tree code constructions
- Streaming Codes for Multicast Over Burst Erasure Channels
- Layered Constructions for Low-Delay Streaming Codes
- Efficient Coding for Interactive Communication
- Linear-time encodable and decodable error-correcting codes
- Coding for interactive communication
- A note on a partial ordering for communication channels
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- MULTISCALED CROSS-CORRELATION DYNAMICS IN FINANCIAL TIME-SERIES
- Foundations of Cryptography
- Coding for Interactive Communication: A Survey
- Maintaining Stream Statistics over Sliding Windows
- Deterministic coding for interactive communication
- Sliding-Window Raptor Codes for Efficient Scalable Wireless Video Broadcasting With Unequal Loss Protection
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- A binary channel characterization using partitioned Markov chains
- Optimal Coding for Streaming Authentication and Interactive Communication
