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
Abstract :
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
Keywords :
block codes; computational complexity; source coding; trellis codes; Hamming distortion measure; Marion block coding exponent; binary source; computational complexity; error exponent; rate-distortion curve; single-letter lower bound; trellis source coding; Block codes; Computational complexity; Computational modeling; Convolutional codes; Distortion measurement; Performance analysis; Rate-distortion; Redundancy; Source coding; Viterbi algorithm;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523680
