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

DOI10.1109/TIT.2014.2307062zbMATH Open1360.94199OpenAlexW2122967654MaRDI QIDQ2986394FDOQ2986394

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)

• Title not available (Why is that?)
• Rate-Constrained Simulation and Source Coding i.i.d. Sources
• Delay and Redundancy in Lossless Source Coding
• Online Learning over a Finite Action Set with Limited Switching
• Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes
• 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)