Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

DOI10.1109/18.382013zbMATH Open0834.94012OpenAlexW2113938594MaRDI QIDQ4836893FDOQ4836893

Authors: Kenneth Zeger, Tamás Linder, Gábor Lugosi 

Publication date: 10 April 1996

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

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

Recommendations

• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• Universal coding for memoryless sources with countably infinite alphabets
• Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
• Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources
• Strong universal source coding subject to a rate-distortion constraint

zbMATH Keywords

squared errormemoryless sourcesuniversal codes

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (16)

• Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
• Title not available (Why is that?)
• Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
• A rate of convergence result for a universal D-semifaithful code
• Rate-Constrained Simulation and Source Coding i.i.d. Sources
• On the redundancy of universal lossless coding for general piecewise stationary sources
• Universal codes for a class of composite sources (Corresp.)
• Bounds on achievable convergence rates of parameter estimators via universal coding
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Critical behavior in lossy source coding
• Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
• Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
• Source coding exponents for zero-delay coding with finite memory
• Universal coding for discrete memoryless sources uniform with respect to output
• Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
• Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources

This page was built for publication: Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

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