Talk:Tunstall coding: Difference between revisions

Revision as of 12:35, 20 January 2013

Revision as of 07:27, 2 September 2015

Line 2:

{{WikiProject Articles for creation|class=C|ts=20130120123530|reviewer=Excirial}}

== 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 [https://smartech.gatech.edu/handle/1853/15041 here], page 19 clearly states as part of the algorithm that the most probable word should be replaced by <math>N_A</math> words, which is defined on page 18 as the size of alphabet <math>A</math>, 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. [[User:Espadrine|Espadrine]] ([[User talk:Espadrine|talk]]) 07:27, 2 September 2015 (UTC)