| Softcover ISBN: | 978-2-85629-782-7 |
| Product Code: | COSP/21 |
| List Price: | $67.00 |
| AMS Member Price: | $53.60 |
-
Book DetailsCours SpécialisésVolume: 21; 2014; 140 ppMSC: Primary 62; 68;
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.ReadershipPostgraduate students and research mathematicians interested in universal coding and order identification.
-
Request Review Copy
- Book Details
-
- Request Review Copy
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.
Postgraduate students and research mathematicians interested in universal coding and order identification.
