Arithmetic Coding with Folds and Unfolds
Arithmetic coding is a method for data compression. It produces a theoretically optimal compression under much weaker assumptions than Huffman and Shannon-Fano, and can compress within one bit of the limit imposed by Shannon's Noiseless Coding Theorem. Earlier presentations provided little in t...
Main Authors: | Bird, R, Gibbons, J |
---|---|
Format: | Conference item |
Published: |
Springer−Verlag
2003
|
Similar Items
-
Arithmetic Coding with Folds and Unfolds
by: Bird, R, et al.
Published: (2003) -
Arithmetic coding with folds and unfolds
by: Bird, R, et al.
Published: (2003) -
When is a Function a Fold or an Unfold?
by: Gibbons, J, et al.
Published: (2001) -
When is a function a fold or an unfold?
by: Gibbons, J, et al.
Published: (2001) -
On folding and unfolding with linkages and origami
by: Abel, Zachary Ryan
Published: (2017)