Fast Recursive Coding Based on Grouping of Symbols
Information Theory
2007-08-22 v1 math.IT
Abstract
A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indirectly provides rather effective coding of symbols for very large alphabets. The code length for the proposed technique can be up to 20-30% less than for arithmetic coding and, in the worst case it is only by 1-3% larger.
Cite
@article{arxiv.0708.2893,
title = {Fast Recursive Coding Based on Grouping of Symbols},
author = {Nikolay Ponomarenko and Vladimir Lukin and Karen Egiazarian and Jaakko Astola and Boris Y Ryabko},
journal= {arXiv preprint arXiv:0708.2893},
year = {2007}
}
Comments
3 pages, submitted to IEEE Transactions on Information Theory