Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding

DOI10.1109/TIT.2014.2307062MaRDI QIDQ2986394zbMATH OpenOpenAlexFDO

Authors András György, Gergely Neu

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2014.2307062

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(6)

• Rate-Constrained Simulation and Source Coding i.i.d. Sources
• Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes
• Delay and Redundancy in Lossless Source Coding
• Online learning over a finite action set with limited switching
• scientific article; zbMATH DE number 5010756 (Why is no real title available?)
• Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast

This page was built for publication: Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding

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