Publisher: MIT OpenCourseWare.
Cited passages: Polyanskiy and Wu, MIT 6.441 course notes, Section 5.3, Theorem 5.3.
Cited passages: Chapter 1, Definition 1.3, printed p. 8; Theorem 1.1(4), printed p. 10.
Cited passages: Section 2.4, Definition 2.4 and Theorem 2.5(1), printed pp. 26–27; Theorem 2.1, printed p. 20; Theorem 2.3(1,3), printed p. 23; Theorem 2.4(2) and Corollary 2.4, printed p. 24; Theorem 2.4(1) and its proof, printed p. 24: I(X;X) is infinite for a non-discrete distribution; Theorem 2.4(3), printed p. 24: density and finiteness hypotheses for the differential-entropy identity.
Cited passages: MIT 6.441, Chapter 2, Definition 2.4 and Theorem 2.5(1); MIT 6.441, Chapter 2, note following Theorem 2.5.
Cited passages: §23.2, Definition 23.1 and Theorem 23.2, printed pp. 242–243: reconstruction alphabets, separable distortion and the information converse.
Cited passages: §24.1, Theorem 24.1, printed pp. 246–247; §24.2, Theorem 24.2, printed p. 247: memoryless source hypotheses, single-letterization and asymptotic achievability.
Cited passages: §25.1.1, Bernoulli Source, printed p. 255: binary Hamming distortion, achievable backward test channel and converse.

Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3. Home

Incoming links (3)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version