This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 Data Compression Conference
Variable-Length Source Compression Using Successive Refinement and Non-linear Graph-Based Codes
Snowbird, Utah USA
March 29-March 31
ISBN: 978-0-7695-4352-9
In this paper we propose a variable-length source code that achieves very good performance even for short sequences and has low encoding complexity, although it does not achieve the theoretical limit. Furthermore, the performance can be predicted for infinite codeword length with close form expressions, and has been proven to be good even when a sub optimum decoder with very low complexity is employed at the decoder side.
Citation:
Francisco Ramirez-Javega, Meritxell Lamarca, "Variable-Length Source Compression Using Successive Refinement and Non-linear Graph-Based Codes," dcc, pp.473, 2011 Data Compression Conference, 2011
Usage of this product signifies your acceptance of the Terms of Use.