On the redundancy of trellis lossy source coding

DOI10.1109/18.971749zbMATH Open1059.94009OpenAlexW2145898538MaRDI QIDQ4544775FDOQ4544775

Authors: Guangcai Zhou, Zhen Zhang 

Publication date: 4 August 2002

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

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

Recommendations

• Variable-rate trellis source encoding
• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)
• Complexity-constrained trellis quantizers
• The redundancy of source coding with a fidelity criterion. 1. Known statistics

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (6)

• Delay and Redundancy in Lossless Source Coding
• On the redundancy of universal lossless coding for general piecewise stationary sources
• Tree encoding of memoryless time-discrete sources with a fidelity criterion
• Title not available (Why is that?)
• On the Error Exponent of Trellis Source Coding
• On the redundancy of lossy source coding with abstract alphabets

This page was built for publication: On the redundancy of trellis lossy source coding

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