Optimum quantizer performance for a class of non-Gaussian memoryless sources
From MaRDI portal
Publication:3329365
DOI10.1109/TIT.1984.1056920zbMath0541.94012WikidataQ56225472 ScholiaQ56225472MaRDI QIDQ3329365
Nariman Farvardin, James W. Modestino
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
recursive algorithmworst case performancememoryless sourcesentropy encoded uniform quantizationperformance of optimum quantizersrate-distortion bound
Related Items
Bayesian learning of finite generalized Gaussian mixture models on images ⋮ Decision-Theoretic Saliency: Computational Principles, Biological Plausibility, and Implications for Neurophysiology and Psychophysics