Source coding bounds using quantizer reproduction levels (Corresp.)

DOI10.1109/TIT.1984.1056902zbMATH Open0541.94013MaRDI QIDQ3329367FDOQ3329367

Authors: William A. Pearlman, Ali Chekima 

Publication date: 1984

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

Recommendations

• Alphabet-constrained vector quantization
• Fixed-rate encoding of nonstationary information sources
• Distortion bounds for vector quantizers with finite codebook size
• Strong universal source coding subject to a rate-distortion constraint
• Optimum quantizer performance for a class of non-Gaussian memoryless sources

zbMATH Keywords

coding boundsencoding continuous-amplitude memoryless sourcesrate-distortion boundrate-distortion functionsreproduction alphabet

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Cited In (11)

• Title not available (Why is that?)
• Permutation codes for sources
• Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization
• Minimum breakdown degradation in binary source encoding
• Source Coding for Quasiarithmetic Penalties
• Rate distortion functions of countably infinite alphabet memoryless sources
• Recoding-derived bounds for input encoding
• Rate-distortion bounds for quotient-based distortions with application to Itakura- Saito distortion measures
• Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error
• Optimum quantizer performance for a class of non-Gaussian memoryless sources
• Analytical coding of Gaussian sources

This page was built for publication: Source coding bounds using quantizer reproduction levels (Corresp.)

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