Record
- Authors
- Cover, T. M.; Thomas, J. A.
- Year
- 2006
- Title
- Elements of Information Theory
- Edition
- 2nd
- Type
- Book
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
cover-2006-elements-information-theory
Cited on
- Cross-Entropy and Kullback–Leibler Divergence read status: not stated
- Differential Entropy and the Gaussian for Chapter 8; Section 8.3; Section 8.5 read status: not stated
- Entropy read status: not stated
- Index Compression for sections 5.3 and 5.5 read status: not stated
- Information Theory read status: not stated
- Maximum Entropy Distributions for Chapter 12; Section 12.1; Section 12.2 read status: not stated
- Mutual Information read status: not stated
- Perplexity and Source Coding for Chapter 5; Section 5.2; Section 5.4; Section 5.5; Section 5.8 read status: not stated
As cited
The pages cite this work in 5 forms.
-
Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd edition. Wiley.
-
Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd edition, sections 5.3 and 5.5. Wiley.
-
Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd edition. Wiley. Chapter 12, "Maximum Entropy" (Section 12.1, "Maximum Entropy Distributions"; Section 12.2, "Examples").
-
Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd edition. Wiley. Chapter 5, "Data Compression" (Section 5.2, "Kraft Inequality"; Section 5.4, "Bounds on the Optimal Code Length"; Section 5.5, "Kraft Inequality for Uniquely Decodable Codes"; Section 5.8, "Optimality of Huffman Codes").
-
Cover, T. M., and Thomas, J. A. (2006). Elements of Information Theory, 2nd edition. Wiley. Chapter 8, "Differential Entropy" (Section 8.3, "Relation of Differential Entropy to Discrete Entropy"; Section 8.5, "Relative Entropy and Mutual Information").
BibLaTeX
@book{cover-2006-elements-information-theory,
author = {Cover, T. M. and Thomas, J. A.},
title = {{Elements of Information Theory}},
date = {2006},
edition = {2}
}