Talk:Data Compression

Possible changes
"...-- even one 50,000 euro cash prize for compressing one particular benchmark file as small as possible (and, of course, uncompressing it afterwards)." This should have some link added or generalized (this type of prizes are expected to always be present), there is no particular need at that point of the introduction to be so specific. --Panic (talk) 04:45, 3 December 2009 (UTC)

As far as I know, only two data compression competitions with cash prizes have ever existed. Please add the others of "this type of prizes" to the two already listed on the Data Compression/References page. Thank you. --DavidCary (discuss • contribs) 20:36, 28 July 2011 (UTC)


 * What I meant was that the need for stating the exact sum, variable and relative in regards to the monetary award value was unnecessary and did not contribute anything of particular value (except if the point is to somehow equate a monetary value to the field). There may indeed be more prizes equal in goal or similar in what they would permit to do (there are math prices that could result in improvements in compression, even if not exclusively focused on the issue) and there are a lot of foundations and organizations that even if not expressly stated would probably reward any significant advancement.
 * That was my intention above, to remark that as a reader I did not understand why one prize amount should be so important (Hutter Prize), as an example of what is available I don't think it as relevant, necessary and complete (in that section, for instance later on on the book it would be if the challenge was examined in detail). But that is my opinion...  --Panic (discuss • contribs) 22:46, 28 July 2011 (UTC)

lost data compression techniques
It recently came to my attention that several articles on Wikipedia about data compression techniques have been deleted. Such articles include Reduced Offset Lempel Ziv (ROLZ), Lempel–Ziv–Tamayo (LZT) -- both mentioned on the current w:Template:Compression methods -- and also Polar_Tree (Wikipedia:Wikipedia:Requests for undeletion/Archive 18) , WinRK, NanoZip, and asymmetric binary system. Is there a way for me to find data compression articles that are about to be deleted, or other deleted data compression algorithms, and import the more useful ones to this Wikibook?

My understanding is that most data compression techniques can meet the relatively low barrier of the NOR, even the ones that are so new or obscure that they do not (yet) meet the apparently much more strict NOR policy.

While I personally am fascinated by data compression techniques that are so new or obscure that they don't even meet the NOR, there are other places that are even better for discussing them -- in particular, Wikiversity (as implied by NOR) and the other discussion forums listed on the Data Compression/References page are better places for discussing such state-of-the-art ideas. --DavidCary (discuss • contribs) 21:52, 17 August 2011 (UTC)


 * You can probably ask an admin that is active on Wikipedia to request an undelete so the pages can be transwikied. To find out what pages are deleted you must keep an eye on the equivalent to the deletion requests page at Wikipedia. --Panic (discuss • contribs) 04:13, 18 August 2011 (UTC)
 * Note that if you reach a willing admin at wikipedia, since the undeletion is not for restoration of the article there, it will skip the formalization of a request for undeletion. --Panic (discuss • contribs) 22:13, 27 September 2011 (UTC)

Anamorphic stretch transform (AST)
New data compression method from the UCLA Henry Samueli School of Engineering and Applied Science. (News Article). --Panic (discuss • contribs) 16:21, 1 January 2014 (UTC)