3 ms·
Introduction to Data Compression (2013) [pdf]
- lifthrasiir 7y agoOne may also want to refer to Data Compression Explained (2013) [1] as a comprehensive introduction to many higher-end compression algorithms. [1] http://mattmahoney.net/dc/dce.html http://mattmahoney.net/dc/dce.html
- LifeLiverTransp 7y agoNot even mentioning conways compression? You can compress any data fragment down into a final state of a deterministic game. e.g. Just take a chessboard, and apply any sequence of moves - and you have something in chessboard binary from above. This is even better with productive gamerules, like for example conways game of life. These type of algorithms (with shared knowledge) allow for a much more tailored to the actual usecase optimization. Just have some prepared gamestates ('openings') most similar, and add some manipulation that gets you there in n steps. This also allows you to efficiently trade between space (stored openings) and parallelizable computation (game rounds) to restore a data fragment. NN: Optimizations can used to identify opening game rounds. To lazy to search and post the various papers on this.