Analytic information theory : from compression to learning /

"Aimed at graduate students and researchers interested in information theory and the analysis of algorithms, this book explores problems of information and learning theory, demonstrating how to use tools from analytic combinatorics to discover and analyze precise behavior of source codes"-...

Full description

Saved in:
Bibliographic Details
Main Authors: Drmota, Michael, 1957- (Author)
Group Author: Szpankowski, Wojciech, 1952-
Published: Cambridge University Press,
Publisher Address: Cambridge, United Kingdom :
Publication Dates: 2023.
Literature type: Book
Language: English
Subjects:
Summary: "Aimed at graduate students and researchers interested in information theory and the analysis of algorithms, this book explores problems of information and learning theory, demonstrating how to use tools from analytic combinatorics to discover and analyze precise behavior of source codes"--
Carrier Form: xvi, 363 pages : illustrations ; 27 cm
Bibliography: Includes bibliographical references (pages 347-359) and index.
ISBN: 9781108474443
1108474446
9781108464642
1108464645
Index Number: Q360
CLC: O157.4
Call Number: O157.4/D782
Contents: Preliminaries -- Shannon and Huffman FV codes -- Tunstall and Khodak VF codes -- Divide-and-conquer VF codes -- Khodak VV codes -- Nonprefix one-to-one codes -- Advanced data structures : tree compression -- Graph and structure compression -- Minimax redundancy and regret -- Redundancy of universal memoryless sources -- Markov types and redundancy for Markov sources -- Non-Markovian sources : redundancy of renewal processes.