Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compression > #2248

Re: Truffman coding

Show all headers | View raw

James Dow Allen <gmail@jamesdowallen.nospam> writes:
> Pursuing a recent discussion here, I developed a new static-probability 
> coding method I call "Truffman Coding."  It may seem obvious and 
> uninteresting but AFAIK I've never seen such a variant published.  (I think 
> 20th-century quasi-arithmetic codes mostly handle only binary decisions.) 
> 
> I've described the invention at
>    http://fabpedigree.com/james/truffman.htm#sect2
> (I've pointed this URL at section 2, which may be the only section of that 
> long-winded description worth reading.)
> 
> This code is similar to Huffman coding except that trits are sometimes 
> developed and used for probabilities not well approximated by a power of 
> 1/2.  Huffman codes have an inherent waste of, typically, almost 0.03 bits 
> per token compared with the Shannon limit.  With Truffman coding the 
> inefficiency can be reduced to about 0.01 bits per token.
> 
> For various reasons, this new code may have no real practical value 
> whatsoever.  Nevertheless, it may be interesting enough for a conference 
> paper, or suggest a related method that would be useful.  Any interest?

Not read it closely, but it seems as if there are some ?Tunstall-related
ideas in your Truffmann.

Phil
-- 
Religion is too important a matter to its devotees to be a subject of 
ridicule. If they indulge in absurdities, they are to be pitied rather
than ridiculed. -- Immanuel Kant (1724-1804), lecture at Konigsberg, 1775

Back to comp.compression | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Truffman coding James Dow Allen <gmail@jamesdowallen.nospam> - 2014-03-06 04:40 +0000
  Re: Truffman coding BGB <cr88192@hotmail.com> - 2014-03-07 00:34 -0600
  Re: Truffman coding Phil Carmody <thefatphil_demunged@yahoo.co.uk> - 2014-03-09 16:56 +0200

csiph-web