<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Random data compression &#8211; One bit diff encoding</title>
	<atom:link href="http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/</link>
	<description>Simpler solution for complex problem. Think different - Keshav Shetty</description>
	<lastBuildDate>Thu, 19 Jan 2012 10:16:22 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
	<item>
		<title>By: Keshav Shetty</title>
		<link>http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/comment-page-1/#comment-610</link>
		<dc:creator>Keshav Shetty</dc:creator>
		<pubDate>Sun, 27 Nov 2011 12:14:31 +0000</pubDate>
		<guid isPermaLink="false">http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/#comment-610</guid>
		<description>Hi Ibrahim,

Best case happens when data are in descending order. In this case
for first input you need 8 bit = 1x8 = 8bit
for next 128 inputs we need 7 bit each = 128*7=896bits
for next 64 we need 6 bit = 64*6 = 384 and so on
total  1546 bits (or 193.25 bit)

In worst case i.e data are in ascending order 
for first 128 inputs we need 8 bit each = 128*8=1024bits
for next 64 we need 7 bit = 64*7 = 448 and so on
total  1793 bits (or 224.125 bit)

Best way to visualize this is by applying diff encoding to the input and see observe bits it generates. (try for smaller data set)</description>
		<content:encoded><![CDATA[<p>Hi Ibrahim,</p>
<p>Best case happens when data are in descending order. In this case<br />
for first input you need 8 bit = 1&#215;8 = 8bit<br />
for next 128 inputs we need 7 bit each = 128*7=896bits<br />
for next 64 we need 6 bit = 64*6 = 384 and so on<br />
total  1546 bits (or 193.25 bit)</p>
<p>In worst case i.e data are in ascending order<br />
for first 128 inputs we need 8 bit each = 128*8=1024bits<br />
for next 64 we need 7 bit = 64*7 = 448 and so on<br />
total  1793 bits (or 224.125 bit)</p>
<p>Best way to visualize this is by applying diff encoding to the input and see observe bits it generates. (try for smaller data set)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ibrahim</title>
		<link>http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/comment-page-1/#comment-607</link>
		<dc:creator>Ibrahim</dc:creator>
		<pubDate>Wed, 23 Nov 2011 23:26:20 +0000</pubDate>
		<guid isPermaLink="false">http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/#comment-607</guid>
		<description>As far my results with different formated 256 unique values blocks, I achieved 
Symbols = 256 
Result 1554 bits = 194.25 bytes

Did you mean that one?</description>
		<content:encoded><![CDATA[<p>As far my results with different formated 256 unique values blocks, I achieved<br />
Symbols = 256<br />
Result 1554 bits = 194.25 bytes</p>
<p>Did you mean that one?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ibrahim</title>
		<link>http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/comment-page-1/#comment-606</link>
		<dc:creator>Ibrahim</dc:creator>
		<pubDate>Wed, 23 Nov 2011 23:07:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/#comment-606</guid>
		<description>Please explain:
1545-1793bits(193.125-224.125bytes)

Thanks</description>
		<content:encoded><![CDATA[<p>Please explain:<br />
1545-1793bits(193.125-224.125bytes)</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Keshav Shetty</title>
		<link>http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/comment-page-1/#comment-354</link>
		<dc:creator>Keshav Shetty</dc:creator>
		<pubDate>Wed, 09 Jun 2010 17:21:01 +0000</pubDate>
		<guid isPermaLink="false">http://blog.adityon.com/2010/06/random-data-compression-one-bit-diff-encoding/#comment-354</guid>
		<description>Some of the readers raised query about meaning of doubles or duplicates.
Actually it is my mistake to use wrong word, correct word should non unique value.

When I say unique value, I meant the number (byte) not appeared before in the list, whereas doubles means the number already present in the list.
e.g: lets assume the input bytes are 8, 10, 15, 0, 6, 12, 15, 9, 11, 1, 12, 15
From the list 8, 10, 15, 0, 6, 12, 9, 11, 1 are unique.
Whereas 15,12,15 are doubles or duplicates(non unique).
Note: First 15 and 12 are counted in unique.
First appearance will not treated as non unique.

In the article I mentioned million random digit contains around 90-100 doubles for every block of 256 numbers. That means if it is 90 non unique number then 256-90=166 are unique numbers.

Here on wards I will use the word non unique, instead of doubles or duplicates.

Thanks &amp; regards
Keshav K Shetty</description>
		<content:encoded><![CDATA[<p>Some of the readers raised query about meaning of doubles or duplicates.<br />
Actually it is my mistake to use wrong word, correct word should non unique value.</p>
<p>When I say unique value, I meant the number (byte) not appeared before in the list, whereas doubles means the number already present in the list.<br />
e.g: lets assume the input bytes are 8, 10, 15, 0, 6, 12, 15, 9, 11, 1, 12, 15<br />
From the list 8, 10, 15, 0, 6, 12, 9, 11, 1 are unique.<br />
Whereas 15,12,15 are doubles or duplicates(non unique).<br />
Note: First 15 and 12 are counted in unique.<br />
First appearance will not treated as non unique.</p>
<p>In the article I mentioned million random digit contains around 90-100 doubles for every block of 256 numbers. That means if it is 90 non unique number then 256-90=166 are unique numbers.</p>
<p>Here on wards I will use the word non unique, instead of doubles or duplicates.</p>
<p>Thanks &#038; regards<br />
Keshav K Shetty</p>
]]></content:encoded>
	</item>
</channel>
</rss>

