Error-Resilient Optimal Data Compression

DOI10.1137/S0097539792240789MaRDI QIDQ4376167zbMATH OpenOpenAlexFDO

Authors James A. Storer, J. Reif

Publication date 10 February 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792240789

zbMATH Keywords

adaptive algorithmcommunication channeldata compressionerror propagation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 826049
• Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
• Sending compressed messages to a learned receiver on a bidirectional line.
• Bounds on Data Compression Ratio with a Given Tolerable Error Probability
• scientific article; zbMATH DE number 1630078

Cited in

(11)

• Optimal erasure protection assignment for scalable compressed data with small channel packets and short channel codewords
• Optimal data compression algorithm
• Sending compressed messages to a learned receiver on a bidirectional line.
• Variable-Length Compression Allowing Errors
• scientific article; zbMATH DE number 5968919 (Why is no real title available?)
• Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
• Optimum Compression of a Noisy Measurement for Transmission Over a Noisy Channel
• scientific article; zbMATH DE number 826049 (Why is no real title available?)
• On the average redundancy rate of the Lempel-Ziv code with the k-error protocol
• Optimal encoding of non-stationary sources
• Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms

This page was built for publication: Error-Resilient Optimal Data Compression

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