Home » Archive

Articles Archive for January 2011

Data compression, Featured, Headline »

[9 Jan 2011 by Keshav Shetty | 3 Comments | 5,861 views]
Random data compression – Lowerband & upper band filtering

Wish you all happy new year 2011.
in this article I will explain how a set of unique elements can be represented with less bits using filtering elements into two sets of upper and lower band.

Few users suggested to change the title, because title says “Random data” where as article describes about unique elements. Let me clarify that million random digit contains average 90-110 bytes of duplicate or non unique for every 256 bytes. If we could represent unique data set <=202 byte(worst case), we can use remaining 54 byte to …