Jump to content

Talk:Incompressible string

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Christian75 (talk | contribs) at 17:36, 7 December 2015 (Assessment: +Computer science: class=Stub (assisted)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer science Stub‑class
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Things you can help WikiProject Computer science with:

This page really needs to be rewritten or deleted. The use of first person is abundant and ridiculous.



I may or may not have misunderstood the thing, but the last example 1234999988884321 should be compressible with the RunLengthEncoding-algorithm of Tsukyama, which sees characters appearing twice as "escape-character" (or run value) and needs an additional character to store, how often to repeat: This would lead to: 1234 99(escape-runvalue) 2(run length) 88(Escape-runvalue) 2(run) 4321

So compression would be possible by 2 characters: 1234999988884321 12349928824321 When decompressing, you look for characters(run-values) that appear twice and interpret the next character as how often to repeat this respecitve character(run) 88 2 becomes 88 88, 99 2 becomes 9999.[1] Anyone who can confirm this is correct, before I add this into the article?