Guest
|
 Posted: Sun Oct 12, 2008 4:53 pm Post subject: Yet another coding algorithm |
 |
|
I finished writing a new version of an article describing an
alternative approach to minimum redundancy coding (fixed-length)
without using tree data structures. The initial article (created in
2001) was intended to introduce the concepts so developers could then
customize/optimize it to their specific projects, but it was greatly
misunderstood, so now I fully detail some possible optimizations and
include working source code.
Because of its flexibility, it>s possible to create new versions (for
example integrating quicksort). I accept interesting new submissions
for inclusion in future updates (with proper credit of course).
It seems RC1 holds the record for the smallest machine code size
necessary to generate fixed-length optimal minimum redundancy codes.
Someone correct me if this isn>t accurate.
The document is available at http://rccoding.sf.net/
Constructive feedback is welcome. Thanks for your interest,
Daniel |
|
