Variable-Length Source Compression Using Successive Refinement and Non-linear Graph-Based Codes

In this paper, the authors 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 suboptimum decoder with very low complexity is employed at the decoder side.