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.

Ancestors (4)

  1. 6.441 Information Theory (Spring 2016 lecture notes) by Yury Polyanskiy and others
  2. Mathematics bibliography
  3. Mathematics
  4. Home

Incoming links (1)

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