DocumentCode
699202
Title
Suffix-constrained codes for progressive and robust data compression: Self-multiplexed codes
Author
Jegou, Herve ; Guillemot, Christine
Author_Institution
IRISA/INRIA, Univ. de Beaulieu, Rennes, France
fYear
2004
fDate
6-10 Sept. 2004
Firstpage
1741
Lastpage
1744
Abstract
This paper addresses the issue of robust transmission of Variable Length Codes (VLCs) encoded sources over error-prone channels. A new class of codes, called self-multiplexed codes, is introduced. Their performance in terms of compression is the same as the one of classical VLCs (e.g. Huffman codes). Their property in terms of energy distribution on respective transitions of the codetree allows to confine error propagation to transitions bearing low reconstruction energy. Simulation results reveal high performances in terms of signal to noise ratio.
Keywords
Huffman codes; channel coding; data compression; trees (mathematics); variable length codes; Huffman codes; codetree; energy distribution; error propagation; error-prone channels; progressive-robust data compression; reconstruction energy; robust VLC encoded source transmission; self-multiplexed codes; signal-to-noise ratio; suffix-constrained codes; variable length codes; Data compression; Decoding; Irrigation; Multiplexing; Noise measurement; Robustness; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2004 12th European
Conference_Location
Vienna
Print_ISBN
978-320-0001-65-7
Type
conf
Filename
7079732
Link To Document