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

Groups > comp.compression > #2541

Detecting repetitions

Show all headers | View raw

For an special use case I need kind of an RLE encoding. It should catch 
the smallest repeated sequences (be non-greedy). Runtime efficiency is 
important, compression not (can leave big blocks uncompressed). And it 
must work on bit level (2 input symbols only). Eventually a starting 
point can be provided, from which a backwards search for repetitions can 
start, and the algorithm then may stop before reaching the very 
beginning of the data.

I'm not familiar with compression algorithms, so all hints are appreciated.

For the curious: this is an attempt to compress the output of a Turing 
machine (Busy Beaver), for further analysis of the behaviour (halting, 
endless looping...) of such machines. I want to continue the work of 
Rado et al., but based on my own data structures and basic procedures.

DoDi

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

Thread

Detecting repetitions Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2014-08-30 06:13 +0200
  Re: Detecting repetitions Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2014-08-30 22:26 +0200
  Re: Detecting repetitions James Dow Allen <gmail@jamesdowallen.nospam> - 2014-08-31 03:29 +0000
    Re: Detecting repetitions Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2014-08-31 09:57 +0200
  Re: Detecting repetitions glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2014-08-31 06:08 +0000
    Re: Detecting repetitions Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2014-08-31 12:07 +0200
  Re: Detecting repetitions "Skybuck Flying" <skybuck2000@hotmail.com> - 2014-09-09 08:00 +0200

csiph-web