Skip to Main content Skip to Navigation
Journal articles

Entropy coding with variable-length rewriting systems

Hervé Jégou 1 Christine Guillemot 2
1 LEAR - Learning and recognition in vision
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology
2 TEMICS - Digital image processing, modeling and communication
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : This paper describes a family of codes for entropy coding of memoryless sources. These codes are defined by sets of production rules of the form a.l->b, where a is a source symbol and l,b are sequences of bits. The coding process can be modeled as a finite state machine (FSM). A method to construct codes which preserve the lexicographic order in the binary coded representation is described. For a given constraint on the number of states for the coding process, this method allows the construction of codes with a better compression efficiency than the Hu-Tucker codes. A second method is proposed to construct codes such that the marginal bit probability of the compressed bitstream converges to 0.5 as the sequence length increases. This property is achieved even if the probability distribution function is not known by the encoder.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00105440
Contributor : Hervé Jégou <>
Submitted on : Wednesday, October 11, 2006 - 10:33:40 AM
Last modification on : Wednesday, February 10, 2021 - 3:34:24 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 5:45:23 PM

Files

Identifiers

Citation

Hervé Jégou, Christine Guillemot. Entropy coding with variable-length rewriting systems. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2007, 55 (3), pp.444-452. ⟨10.1109/TCOMM.2006.887490⟩. ⟨inria-00105440⟩

Share

Metrics

Record views

800

Files downloads

853