On the error exponent of trellis source coding
Itay Hen, Neri Merhav · 2005
We develop a single-letter lower bound on the error exponent of trellis source coding. We demonstrate that for the case of a binary source with the Hamming distortion measure, and for rates close to the rate-distortion curve, this bound is superior to Marion's block coding exponent, for the same computational complexity