Design of successively refinable trellis-coded quantizers

DOI10.1109/18.771148MaRDI QIDQ4701407zbMATH OpenOpenAlexFDO

Authors Hamid Jafarkhani, Vahid Tarokh

Publication date 21 November 1999

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

Full work available at URL https://semanticscholar.org/paper/af0e0af2b957ba2761e657230f229c7bad9e8e01

zbMATH Keywords

embedded bit streamsimage browsingprogressive transmissionsuccessive refinabilitytrellis-coded quantizers

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Source coding (94A29)

Recommendations

• Trellis-coded quantization designed for noisy channels
• Multiple description trellis-coded quantization
• Entropy-constrained trellis-coded quantization
• Design, performance, and complexity analysis of residual trellis-coded vector quantizers

Cited in

(6)

• Multiple description trellis-coded quantization
• Fast Trellis-Coded Color Quantization of Images
• Construction and evaluation of trellis-coded quantizers for memoryless sources
• Trellis-based scalar-vector quantizer for memoryless sources
• scientific article; zbMATH DE number 6174028 (Why is no real title available?)
• Successive refinement for the Wyner-Ziv problem and layered code design

This page was built for publication: Design of successively refinable trellis-coded quantizers

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