Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Investigate "PPP Predictor Compression Protocol" as a Possible KnotStorage #2

Open
jdscriven opened this issue Nov 23, 2014 · 1 comment

Comments

@jdscriven
Copy link
Contributor

This algorithm uses a 256x256 (or 512x256 or 768x256 or 1024x256) byte grid that is precomputed based on a corpus (such as english texts) to predict the next byte given the previous few bytes.

http://stackoverflow.com/a/1138856/651794
http://en.wikibooks.org/wiki/Data_Compression/Markov_models

@jdscriven
Copy link
Contributor Author

There is theoretical max compression to 1/8 of original size, since compression is done byte-by-byte. That is, in the best case scenario, every byte will compress to a single bit. What if the next two or three bytes were predicted instead?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant