Skip to main content Accessibility help
×
Hostname: page-component-7bb8b95d7b-wpx69 Total loading time: 0 Render date: 2024-09-23T20:09:05.648Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  05 March 2013

Jean Berstel
Affiliation:
Université de Paris-Est
Dominique Perrin
Affiliation:
Université de Paris-Est
Christophe Reutenauer
Affiliation:
Université du Québec, Montréal
Get access

Summary

This book presents a comprehensive study of the theory of variable length codes. It is a complete reworking of the book Theory of Codes published by the first two authors more than twenty years ago. The present text includes many new results and also contains several additional chapters. Its focus is also broader, in the sense that more emphasis is given to algorithmic questions and to relations with other fields.

The theory of codes takes its origin in the theory of information devised by Shannon in the 1950s. As presented here, it makes use more of combinatorial and algebraic methods than of information theory. Due to the nature of the questions that are raised and solved, this theory has now become clearly a part of theoretical computer science and is strongly related to combinatorics on words, automata theory, formal languages, and the theory of semigroups.

The object of the theory of codes is, from an elementary point of view, the study of the properties concerning factorizations of words into sequences of words taken from a given set. One of the basic techniques used in this book is constructing special automata that perform this kind of parsing. We will show how properties of codes are reflected in combinatorial or algebraic properties of the associated devices.

It is quite remarkable that the problem of encoding as treated here admits a rather simple mathematical formulation: it is the study of embeddings of a free monoid into another. This may be considered to be a basic problem of algebra. There are related problems in other algebraic structures.

Type
Chapter
Information
Codes and Automata , pp. ix - xiv
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×