Computer Chess Club Archives

Search

Messages

Subject: Re: run-length-encoding question (slightly off-topic)

Author: martin fierz

Date: 12:10:35 03/27/02

Go up one level in this thread

On March 27, 2002 at 06:18:39, Dan Andersson wrote:

>In the scheme you are proposing the assumption should be that all the exact
>values in the skip array are equally likely to be a skip value. The easy way of
>ensuring a compact form is to make a Huffman encoding based on the combined
>alphabet. Then you will have a good compression. This compression should in
>theory have a better efficiency than the skip index and a literal.

as far as i have seen in the egtb literature, run-length-encoding is the only
practical thing to do. huffman coding is discarded because it's too slow in
decompression.

aloha
  martin

• Re: run-length-encoding question (slightly off-topic) Dan Andersson 14:05:09 03/27/02
  • Re: run-length-encoding question (slightly off-topic) martin fierz 17:27:10 03/27/02
    • Re: run-length-encoding question (slightly off-topic) Eugene Nalimov 18:45:42 03/27/02
      • Re: RLE question (slightly off-topic) - comparison with datacomp.exe martin fierz 12:51:50 03/28/02
      • Re: run-length-encoding question (slightly off-topic) martin fierz 20:39:35 03/27/02

This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.