OurBigBook.comSite Source code

Shannon second coding theorem

For a discrete memoryless channel, operational capacity equals

C = max_{P_{X}} I (X; Y) .

Rates below

C

admit codes whose error tends to zero, while rates above

C

cannot have vanishing error.

 Ancestors (5)

 Incoming links (4)