| || || || || || || |
Cours Spécialisés--Collection SMF
2014; 140 pp; softcover
List Price: US$67
Member Price: US$53.60
Order Code: COSP/21
A note to readers: This book is in French.
These notes are at the interface between information theory and statistics. They highlight how universal coding and adaptive compression are linked with the statistical inference of random processes, by maximum likelihood or Bayesian methods.
The author starts with classic tools for dealing with finite alphabets, then presents the recent theory of universal coding in infinite aphabets. She shows how it is used to solve problems of order identification, in particular for hidden Markov models.
A publication of the Société Mathématique de France, Marseilles (SMF), distributed by the AMS in the U.S., Canada, and Mexico. Orders from other countries should be sent to the SMF. Members of the SMF receive a 30% discount from list.
Postgraduate students and research mathematicians interested in universal coding and order identification.
Table of Contents
AMS Home |
© Copyright 2014, American Mathematical Society