Content deleted Content added
Line 63:
This article have lack of examples. If anyone got some example please add it. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/217.198.239.190|217.198.239.190]] ([[User talk:217.198.239.190|talk]]) 09:57, 12 May 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Boundary conditions for divergence and the probability of failure ==
In a nice analogy of solving crossword puzzles, the article states, "Based on this new knowledge, they both come up with updated answers and confidence ratings, repeating the whole process until they converge to the same solution."
Or until they clearly diverge, with no solution possible. The failure case ought to be considered, since promising performance close to the Shannon limit without any risk should not be accepted without an estimate of the probability of failure. Failure in a serial communications algorithm could mean loss of an entire message block.
Of course, the probability of failure is the number of initial states for which the two parity calculations do not converge to a single hypothesis divided by the total number of initial states.
Someone who works with Turbo Codes could probably contribute a paragraph on the failure probability of this class of communication algorithms. [[User:David spector|David spector]] ([[User talk:David spector|talk]]) 20:14, 18 July 2009 (UTC)
| |||