Variable-length codes and finite automata - Archive ouverte HAL Access content directly
Book Sections Year : 2010

Variable-length codes and finite automata


The aim of this chapter is to present, in appropriate perspective, some selected topics in the theory of variable-length codes. One of the domains of applications is lossless data compression. The main aspects covered include optimal prefix codes and finite automata and transducers. These are a basic tool for encoding and decoding variable-length codes. Connections with codes for constrained channels and sources are developed in some detail. Generating series are used systematically for computing the parameters of encodings such as length and probability distributions. The chapter contains numerous examples and exercises with solutions.
Fichier principal
Vignette du fichier
handbookcodesindex.pdf (616.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00620817 , version 1 (12-08-2013)


  • HAL Id : hal-00620817 , version 1


Marie-Pierre Béal, Jean Berstel, Brian H. Marcus, Dominique Perrin, Christophe Reutenauer, et al.. Variable-length codes and finite automata. I. Woungang, S. Misra et S. Chandra Misra. Selected Topics in Information and Coding Theory, World Scientific, pp.505-584, 2010, Series on Coding Theory and Cryptology, 978-981-283-716-5. ⟨hal-00620817⟩
106 View
1015 Download


Gmail Facebook Twitter LinkedIn More