Talk:Tunstall coding

Zero probabilities

Masoudarash, this wikipedia page details the Tunstall algorithm, not some imaginary improvement upon it. As clearly stated on Tunstall's (somewhat hard to find) thesis, a copy of which is available here, page 19 clearly states as part of the algorithm that the most probable word should be replaced by $N_{A}$ words, which is defined on page 18 as the size of alphabet $A$, regardless of whether some words have probability zero. Each reference provided details the algorithm this way as well. As a result, I will revert your change. Feel free to discuss it here. Espadrine (talk) 07:27, 2 September 2015 (UTC)