Title :
On the error exponent of trellis source coding
Author :
Hen, Ilan ; Merhav, Neri
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
Abstract :
In this paper, we develop a single-letter lower bound on the error exponent for the problem 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 Marton´s block-coding exponent, for the same computational complexity.
Keywords :
Hamming codes; Viterbi decoding; binary codes; entropy codes; exponential distribution; rate distortion theory; source coding; trellis codes; Hamming distortion measure; Viterbi algorithm; binary source; block coding; computational complexity; error exponent; rate-distortion curve; relative entropy; single-letter lower bound; trellis source coding; Computational complexity; Computational modeling; Convolutional codes; Distortion measurement; Entropy; Performance analysis; Rate-distortion; Redundancy; Source coding; Viterbi algorithm; Block source coding; Viterbi algorithm; block source coding error exponent; computational complexity; rate-distortion function; relative entropy; trellis source coding; trellis source coding error exponent;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.856953
