SOME REMARKS ON SHANNONS NOISY DISCRETE CHANNEL CODING THEOREM |
| 2 | |
| 2010 |
| scientific article | 621.391.019.4 | ||
| 89-94 | message source, source entropy, channel capacity, unreliability, optimum code, error probability, correct reception probability |
| Some questions related to the proof of Shannons theorem are considered. It has been shown that the conditions
of error-free message transmission at channel terminal unreliability bound the source entropy from below and the
channel unreliability from above. The analysis of error probability in information transmission and information
content in message sequence at the channel output has shown that the reliable estimate of these parameters requires
their averaging over the sequence under consideration. |
 |