Talk:Tunstall coding

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.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Articles for creation

	This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
	This article was accepted on 20 January 2013 by reviewer Excirial (talk · contribs).

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)[reply]