<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.3" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Data Compression with the Burrows-Wheeler Transform</title>
	<link>http://marknelson.us/1996/09/01/bwt/</link>
	<description>Programming, mostly.</description>
	<pubDate>Sat, 13 Mar 2010 00:06:53 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.3</generator>

	<item>
		<title>By: Mohan</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-320123</link>
		<dc:creator>Mohan</dc:creator>
		<pubDate>Thu, 17 Dec 2009 11:43:09 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-320123</guid>
		<description>Can anyone please let me know how to run this whole set of codes to compress a file. I really want to compress a set of files using this bwt. But when I try executing it, I have no option of inputting files. Please help me out somehow. I'm really in need of it as I'm doing a dissertation based on it. Please people. Help me out.

Regards,
Mohan</description>
		<content:encoded><![CDATA[<p>Can anyone please let me know how to run this whole set of codes to compress a file. I really want to compress a set of files using this bwt. But when I try executing it, I have no option of inputting files. Please help me out somehow. I&#8217;m really in need of it as I&#8217;m doing a dissertation based on it. Please people. Help me out.</p>
<p>Regards,<br />
Mohan</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-318825</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Wed, 18 Nov 2009 20:39:18 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-318825</guid>
		<description>@arabcoder:

I'm not really sure what you are doing or what your question is.

- Mark</description>
		<content:encoded><![CDATA[<p>@arabcoder:</p>
<p>I&#8217;m not really sure what you are doing or what your question is.</p>
<p>- Mark</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: arabcoder</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-318823</link>
		<dc:creator>arabcoder</dc:creator>
		<pubDate>Wed, 18 Nov 2009 20:32:34 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-318823</guid>
		<description>thank you for your answer, maybe I am doing something wrong</description>
		<content:encoded><![CDATA[<p>thank you for your answer, maybe I am doing something wrong</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-318811</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Wed, 18 Nov 2009 14:46:28 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-318811</guid>
		<description>@arabcoder:

I don't see much interesting in the stackoverflow comment thread.

And yes, arithmetic coding will either equal or outperform Huffman coding.

- Mark</description>
		<content:encoded><![CDATA[<p>@arabcoder:</p>
<p>I don&#8217;t see much interesting in the stackoverflow comment thread.</p>
<p>And yes, arithmetic coding will either equal or outperform Huffman coding.</p>
<p>- Mark</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: arabcoder</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-318810</link>
		<dc:creator>arabcoder</dc:creator>
		<pubDate>Wed, 18 Nov 2009 14:33:56 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-318810</guid>
		<description>You said in your document that huffman cannot compress better than arithmetic coding but then take a look in this stackoverflow question

http://stackoverflow.com/questions/1755624/request-for-comments-on-huffman-compression</description>
		<content:encoded><![CDATA[<p>You said in your document that huffman cannot compress better than arithmetic coding but then take a look in this stackoverflow question</p>
<p><a href="http://stackoverflow.com/questions/1755624/request-for-comments-on-huffman-compression" rel="nofollow">http://stackoverflow.com/questions/1755624/request-for-comments-on-huffman-compression</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-315615</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Thu, 24 Sep 2009 12:22:43 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-315615</guid>
		<description>@eric:

RLE will not have a large effect on compression - it is in place mostly to prevent pathological sort times. If you leave it out, a file with enormously long repeated strings will take a long time to sort, but will still compress well.

Doing RLE only and not Huffman makes no sense.

- Mark</description>
		<content:encoded><![CDATA[<p>@eric:</p>
<p>RLE will not have a large effect on compression - it is in place mostly to prevent pathological sort times. If you leave it out, a file with enormously long repeated strings will take a long time to sort, but will still compress well.</p>
<p>Doing RLE only and not Huffman makes no sense.</p>
<p>- Mark</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: eric</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-315585</link>
		<dc:creator>eric</dc:creator>
		<pubDate>Thu, 24 Sep 2009 07:06:52 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-315585</guid>
		<description>At the same time, do anyone has C source code for BWT? Could you send it to me or post the link? Thanks.

Here is my email address:-
alienchean@gmail.com</description>
		<content:encoded><![CDATA[<p>At the same time, do anyone has C source code for BWT? Could you send it to me or post the link? Thanks.</p>
<p>Here is my email address:-<br />
<a href="mailto:alienchean@gmail.com">alienchean@gmail.com</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: eric</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-315582</link>
		<dc:creator>eric</dc:creator>
		<pubDate>Thu, 24 Sep 2009 06:08:41 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-315582</guid>
		<description>Thanks Mark for your prompt reply.

Actually I am curious on the performance for BWT compression. Let say for the final stage compression, if we use only RLE  or only Huffman coding, wil there be much differ on compression ratio wise?

Because currently I am having a BWT source code which compress the input texts in this sequence. bwtsort-&#62;mtf-&#62;huffman. So I am thinking will it impact much on the compression ratio if I remove the huffman process and replace with RLE. 


-Eric</description>
		<content:encoded><![CDATA[<p>Thanks Mark for your prompt reply.</p>
<p>Actually I am curious on the performance for BWT compression. Let say for the final stage compression, if we use only RLE  or only Huffman coding, wil there be much differ on compression ratio wise?</p>
<p>Because currently I am having a BWT source code which compress the input texts in this sequence. bwtsort-&gt;mtf-&gt;huffman. So I am thinking will it impact much on the compression ratio if I remove the huffman process and replace with RLE. </p>
<p>-Eric</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-315534</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Wed, 23 Sep 2009 13:46:34 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-315534</guid>
		<description>@eric: 

"the BWT patent?"

The basic BWT technology was not patented by the inventors, and their publication of the basics would have prevented any other parties from acquiring a patent.

I am sure there are various block sorting patents covering refinements and tuning, but the basics of the algorithm have never been patented.

- Mark</description>
		<content:encoded><![CDATA[<p>@eric: </p>
<p>&#8220;the BWT patent?&#8221;</p>
<p>The basic BWT technology was not patented by the inventors, and their publication of the basics would have prevented any other parties from acquiring a patent.</p>
<p>I am sure there are various block sorting patents covering refinements and tuning, but the basics of the algorithm have never been patented.</p>
<p>- Mark</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: eric</title>
		<link>http://marknelson.us/1996/09/01/bwt/#comment-315515</link>
		<dc:creator>eric</dc:creator>
		<pubDate>Wed, 23 Sep 2009 03:51:40 +0000</pubDate>
		<guid>http://marknelson.us/1996/09/01/bwt/#comment-315515</guid>
		<description>Does anyone know if BWT patent is still valid? When is the expiration for this patent? Thanks.</description>
		<content:encoded><![CDATA[<p>Does anyone know if BWT patent is still valid? When is the expiration for this patent? Thanks.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
