Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Note that even though the goal, and end result, is that the file is smaller, this is not a compression scheme, since it only works when your values are distributed in one particular way

This statement doesn't sound right. I think he's trying to say it's not a general purpose compression scheme, but every compression scheme only works on certain patterns. In fact, most possible streams of bytes are not compressible at all. Even the general purpose approaches only work on very specific types of inputs (such as natural language) which contain a lot of redundancy.



Not only that, but I believe these "imperial varints" could be described as special-case of huffman coding.


This is true for all varints. The choice of encoding just changes the shape of the decision tree.


It's as much of a compression scheme as all the other variable width integer methods are.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: