pith. sign in

arxiv: 0708.2893 · v1 · submitted 2007-08-21 · 💻 cs.IT · math.IT

Fast Recursive Coding Based on Grouping of Symbols

Nikolay Ponomarenko , Vladimir Lukin , Karen Egiazarian , Jaakko Astola , Boris Y Ryabko This is my paper
classification 💻 cs.IT math.IT
keywords codingfastonlyproposedrecursivesymbolstechniquealgorithm
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.