Talk:Fano's inequality

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Statistics Low‑importance

	This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics articles
Low	This article has been rated as Low-importance on the importance scale.

Probability of communication error[edit]

Shouldn't the definition of the probability of communication error be:

P(e)=\sum _{j\not =i}P(y_{j},x_{i})

instead of:

P(e)=\sup _{i}\sum _{j\not =i}P(y_{j}|x_{i})

This way, the total probability mass of generating a message x and receiving a different message y is calculated. What is currently written, calculates the probability of error that is largest for a particular message. However, this does not take into account the fact that the probability of generating this message could be very small.

Where can I find the proof of the "Alternative formulation"?[edit]

$SUBJ — Preceding unsigned comment added by Lockywolf (talk • contribs) 11:26, 30 September 2015 (UTC)[reply]