Efficient Error-Correcting Codes for Sliding Windows

DOI10.1007/978-3-319-04298-5_23MaRDI QIDQ2938105zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Rafail Ostrovsky, Alan Roytman

Publication date 13 January 2015

Published in SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04298-5_23

Mathematics Subject Classification ID

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

Recommendations

• Efficient error-correcting codes for sliding windows
• Sliding-window dynamic frameproof codes
• Efficient erasure correcting codes
• Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• scientific article; zbMATH DE number 1424169
• Efficient error-limiting variable-length codes
• Locally Repairable Convolutional Codes With Sliding Window Repair
• Optimal codes for error detection
• Optimal codes for correcting single errors and detecting adjacent errors

Cited in

(5)

• Interactive non-malleable codes
• Sliding-window dynamic frameproof codes
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• Efficient error-correcting codes for sliding windows
• 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 Q2938105)