Title :
Constructing optimal whole-bit recycling codes
Author :
Dubé, Danny ; Beaudoin, Vincent
Author_Institution :
Dept. d´´Inf. et de Genie Logiciel, Univ. Laval, Quebec City, QC, Canada
Abstract :
Bit recycling aims at improving the rates achieved by compression techniques, such as LZ77, that suffer from the redundancy caused by the multiplicity of the encodings. The performance of bit recycling depends crucially on the recycling codes that it uses. A recipe for the construction of optimal recycling codes has been mentioned in previous work. However, no efficient algorithm and proof of optimality were given. We present both here.
Keywords :
codes; data compression; compression techniques; encoding; optimal whole-bit recycling codes; Data compression; Encoding; Propagation losses; Recycling;
Conference_Titel :
Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on
Conference_Location :
Volos
Print_ISBN :
978-1-4244-4535-6
Electronic_ISBN :
978-1-4244-4536-3
DOI :
10.1109/ITWNIT.2009.5158535
