zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Theory of codes. (English) Zbl 0587.68066
Pure and Applied Mathematics, 117. Orlando etc.: Academic Press, Inc. XIV, 433 P. $ 60.00; £60.00 (1985).

This book is the first treatise on variable-length codes; it provides a systematic exposition of the topic, showing its connection with theoretical computer science (automata, semigroups, formal languages), probability, noncommutative algebra, permutation groups, combinatorics. The subject is part of what is called effective mathematics and presents many algorithms and constructions of families of codes - although the construction of all finite maximal codes is still an open problem.

The authors have chosen to develop the theory in the most general way, in order to point out the main arguments. Indeed, they treat the case of thin codes, which generalize finite and even recognizable codes. Chapter 0 is an introductory chapter on monoids, words, automata, formal series and permutation groups. Chapter 1 is the real beginning: codes, a test for codes, complete and maximal codes. Chapter 2 gives a systematic study of prefix codes; this chapter is very intuitive, particularly because of the use of trees; however, it ends with a deep result on deciphering delay. Chapter 3 presents the beautiful combinatorial theory of biprefix codes, and the various characterizations of the degree. Chapter 4 is rather technical, but necessary for the syntactic approach which is used in the next chapter; it presents a special class of automata, the unambiguous automata; the first application is the theorem of synchronization of semaphore codes. In chapter 5 the permutation groups associated with biprefix codes are studied; the main result states that if the code is moreover finite and indecomposable, then this group is doubly transitive. Chapter 6 gives the probabilistic approach of codes; the formula relating degree and density is proved. Chapter 7 deals with problems about conjugacy; it gives results on circular codes and various results on constructions of optimal circular codes and factorization of free monoids. Chapter 8 presents the commutative factorization theorem; see the last chapter of the forthcoming book of J. Berstel and the reviewer (Rational series and their languages, Springer Verlag) for the extension of this theorem to the noncommutative case; the last result links biprefix codes and semisimple algebras.

The whole book is written at an elementary level and may be used for courses at various levels in computer science, algebra or probability theory. Each chapter ends with an exercise section and bibliographical and historical notes.

Reviewer: C.Reutenauer

MSC:
68Q45Formal languages and automata
68Q70Algebraic theory of languages and automata
68-01Textbooks (computer science)
94-01Textbooks (information and communication)
94A45Prefix, length-variable, comma-free codes (communication theory)
20M35Semigroups in automata theory, linguistics, etc.
20M05Free semigroups, generators and relations, word problems
20M12Ideal theory of semigroups
20B20Multiply transitive finite permutation groups
60B99Probability theory on general structures
16S10Associative rings determined by universal properties