Data-Compression.org

data compression link collection

David A. Scott’s Fully Bijective Arithmetic Coder

Published in Non-Commercial Programs, Source Code, Esoterica/Miscellany, Arithmetic Coding

The term bijective as used by Scott means that for any given given file X you are guarantted that A( B( X ) ) == B( A( X ) ) == X, where A and B are a pair of bijectively matched programs. In this particular case, A and B are a compressor and decompressor that use arithmetic coding. Includes C++ source.

http://bijective.dogma.net/compres10.htm

* * *    

admin
Posted in May 1st, 2001

No User Commented In " David A. Scott’s Fully Bijective Arithmetic Coder "

Subscribes to this post Comment RSS or TrackBack URL

Leave Your Reply Below

 Username

 Email Address

 Website

Sticky note: Please double check your comments before submit Please Note: The comment moderation maybe active so there is no need to resubmit your comment