Trellis Encoding of memoryless discrete-time sources with a fidelity criterion

Authors:
A. Viterbi;J. Omura
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 1

Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

Problems of Information Transmission

Quantified Score

Hi-index	754.84

Visualization

Abstract

For memoryless discrete-time sources and bounded single-letter distortion measures, we derive a bound on the average per-letter distortion achievable by a trellis source code of fixed constraint length. For any fixed code rate greater thanR(D^{ast}), the rate-distortion function atD^{ast}, this bound decreases towardD^{ast}exponentially with constraint length.