Efficient error-correcting codes for sliding windows

DOI10.1137/18M1235703MaRDI QIDQ5220468zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Rafail Ostrovsky, 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

zbMATH Keywords

communicationerror-correcting codessliding windowsstreaming algorithms

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)

Recommendations

• Efficient Error-Correcting Codes for Sliding Windows
• Optimal coding for streaming authentication and interactive communication
• Towards optimal deterministic coding for interactive communication
• Coding for interactive communication correcting insertions and deletions
• Optimal rate code constructions for computationally simple channels

Cites work

• A binary channel characterization using partitioned Markov chains
• A note on a partial ordering for communication channels
• An improvement of the tree code construction
• Coding for interactive communication
• Coding for interactive communication: a survey
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Deterministic coding for interactive communication
• Efficient Coding for Interactive Communication
• Foundations of Cryptography
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 1414321 (Why is no real title available?)
• Layered Constructions for Low-Delay Streaming Codes
• Linear-time encodable and decodable error-correcting codes
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Maintaining Stream Statistics over Sliding Windows
• MULTISCALED CROSS-CORRELATION DYNAMICS IN FINANCIAL TIME-SERIES
• Optimal Coding for Streaming Authentication and Interactive Communication
• Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
• Sliding-Window Raptor Codes for Efficient Scalable Wireless Video Broadcasting With Unequal Loss Protection
• Streaming Codes for Multicast Over Burst Erasure Channels
• Towards deterministic tree code constructions

Cited in

(4)

• Sliding-window dynamic frameproof codes
• Efficient Error-Correcting Codes for Sliding Windows
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• Optimal coding for streaming authentication and interactive communication

This page was built for publication: Efficient error-correcting codes for sliding windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220468)