Talk:Tunstall coding
Latest comment: 9 years ago by Espadrine in topic Zero probabilities
| This is the talk page for discussing improvements to the Tunstall coding article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Zero probabilities
editMasoudarash, 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 words, which is defined on page 18 as the size of alphabet , 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)
