Record
- Authors
- MacKay, D. J. C.
- Year
- 2003
- Title
- Information Theory, Inference, and Learning Algorithms
- Type
- Book
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
mackay-2003-information-theory-inference-learning-algorithms
Cited on
- Cross-Entropy and Kullback–Leibler Divergence for Section 2.6; Chapter 33 read status: not stated
- Entropy for Section 2.4 read status: not stated
- Information Theory read status: not stated
- Mutual Information for Section 8.1; Section 8.3 read status: not stated
- Perplexity and Source Coding for Chapter 5; Sections 5.2 to 5.5; Section 6.2 read status: not stated
As cited
The pages cite this work in 5 forms.
-
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press.
-
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. Chapter 5, "Symbol Codes" (Sections 5.2 to 5.5; Exercise 5.16), and Section 6.2, "Arithmetic codes".
-
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. Section 2.4, "Definition of entropy and related functions".on Entropy
-
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. Section 2.6, "Gibbs' inequality"; Exercise 2.26 and its solution; Chapter 33, "Variational Methods".
-
MacKay, D. J. C. (2003). Information Theory, Inference, and Learning Algorithms. Cambridge University Press. Section 8.1, "More about entropy" (Figure 8.1), and Section 8.3, Exercise 8.9 (the data-processing theorem).
BibLaTeX
@book{mackay-2003-information-theory-inference-learning-algorithms,
author = {MacKay, D. J. C.},
title = {{Information Theory, Inference, and Learning Algorithms}},
date = {2003}
}