<?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: LZW Data Compression</title>
	<atom:link href="http://marknelson.us/1989/10/01/lzw-data-compression/feed/" rel="self" type="application/rss+xml" />
	<link>http://marknelson.us/1989/10/01/lzw-data-compression/</link>
	<description>Programming, mostly.</description>
	<lastBuildDate>Tue, 07 Feb 2012 16:05:51 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: www.Phototalks.idv.tw &#187; LZW compression &#38; decompression</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-442414</link>
		<dc:creator>www.Phototalks.idv.tw &#187; LZW compression &#38; decompression</dc:creator>
		<pubDate>Mon, 02 Jan 2012 07:48:13 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-442414</guid>
		<description>[...] 期末考記錄用  參考自此但我覺得需要修改 [...]</description>
		<content:encoded><![CDATA[<p>[...] 期末考記錄用  參考自此但我覺得需要修改 [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-384387</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Mon, 03 Oct 2011 20:03:51 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-384387</guid>
		<description>@Patrick:

Isn&#039;t that a question for the people who make Lan Messenger? I have no idea.</description>
		<content:encoded><![CDATA[<p>@Patrick:</p>
<p>Isn&#8217;t that a question for the people who make Lan Messenger? I have no idea.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-384382</link>
		<dc:creator>Patrick</dc:creator>
		<pubDate>Mon, 03 Oct 2011 19:57:51 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-384382</guid>
		<description>Hi Mark, I have one question for you, I hope you could help me with this.

It is possible to embed LZW algorithm in LAN Messenger because I want to Compress and Decompress file and embed it in LAN Messenger? I want to use a Visual Basic or Visual C# programming language. 

I hope you would reply immediately. Thank you.</description>
		<content:encoded><![CDATA[<p>Hi Mark, I have one question for you, I hope you could help me with this.</p>
<p>It is possible to embed LZW algorithm in LAN Messenger because I want to Compress and Decompress file and embed it in LAN Messenger? I want to use a Visual Basic or Visual C# programming language. </p>
<p>I hope you would reply immediately. Thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SPEEDY</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-374851</link>
		<dc:creator>SPEEDY</dc:creator>
		<pubDate>Wed, 14 Sep 2011 19:18:00 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-374851</guid>
		<description>There are ways to enhance or speed up the LZW codec.

In the encoder  the slowest part is to determine whether the incoming symbol + the stored string is in the table of the range of  0-to the max code of the table. Entries used in the table grow with the incoming symbols in the encoder.

The search part can be divided into the SYMBOL and  the STRING
parts both in the encoder and decoder.</description>
		<content:encoded><![CDATA[<p>There are ways to enhance or speed up the LZW codec.</p>
<p>In the encoder  the slowest part is to determine whether the incoming symbol + the stored string is in the table of the range of  0-to the max code of the table. Entries used in the table grow with the incoming symbols in the encoder.</p>
<p>The search part can be divided into the SYMBOL and  the STRING<br />
parts both in the encoder and decoder.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: youngyt</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-367389</link>
		<dc:creator>youngyt</dc:creator>
		<pubDate>Fri, 08 Jul 2011 07:32:58 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-367389</guid>
		<description>Mark, thanks for your reply. I get some clues from your reply.

I have solved it already. Besides three global pointers, four static local vars in input_code and output_code repectively should be changed to global and should be set to zero before each compress and expand.

Maybe it&#039;s not very formal and strict, but it give me a huge help, thank you.</description>
		<content:encoded><![CDATA[<p>Mark, thanks for your reply. I get some clues from your reply.</p>
<p>I have solved it already. Besides three global pointers, four static local vars in input_code and output_code repectively should be changed to global and should be set to zero before each compress and expand.</p>
<p>Maybe it&#8217;s not very formal and strict, but it give me a huge help, thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-367054</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Thu, 07 Jul 2011 16:44:43 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-367054</guid>
		<description>@youngt:

When I created this program, it was designed to run one time - I didn&#039;t try to make a library component that could be reused. There are many places things could go wrong if you try to run the compressor twice, so you are going to have to keep looking.

- Mark</description>
		<content:encoded><![CDATA[<p>@youngt:</p>
<p>When I created this program, it was designed to run one time &#8211; I didn&#8217;t try to make a library component that could be reused. There are many places things could go wrong if you try to run the compressor twice, so you are going to have to keep looking.</p>
<p>- Mark</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: youngyt</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-367025</link>
		<dc:creator>youngyt</dc:creator>
		<pubDate>Thu, 07 Jul 2011 15:29:18 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-367025</guid>
		<description>Hi,Mark!

I have tried this code and made some changes. I modify the params of compress() and expand() to compress from one specified character stream(in memory) and expand to a memory address.
However, I find that if I compress a same string and expand it twice, the result of expanding of the second time is wrong, the first is right.
I memset zero to those global memory vars before compressing. Why does it happen?  Anything don&#039;t I concern?</description>
		<content:encoded><![CDATA[<p>Hi,Mark!</p>
<p>I have tried this code and made some changes. I modify the params of compress() and expand() to compress from one specified character stream(in memory) and expand to a memory address.<br />
However, I find that if I compress a same string and expand it twice, the result of expanding of the second time is wrong, the first is right.<br />
I memset zero to those global memory vars before compressing. Why does it happen?  Anything don&#8217;t I concern?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Nelson</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-6/#comment-354696</link>
		<dc:creator>Mark Nelson</dc:creator>
		<pubDate>Sun, 10 Apr 2011 17:21:57 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-354696</guid>
		<description>That&#039;s an estimate of the longest possible symbol that the tree can accommodate. I&#039;m not sure if there is an exact formula for the longest symbol given a specific dictionary size.</description>
		<content:encoded><![CDATA[<p>That&#8217;s an estimate of the longest possible symbol that the tree can accommodate. I&#8217;m not sure if there is an exact formula for the longest symbol given a specific dictionary size.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Filip</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-5/#comment-354669</link>
		<dc:creator>Filip</dc:creator>
		<pubDate>Sun, 10 Apr 2011 09:09:49 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-354669</guid>
		<description>Mark, I have one question. Why is size of decode stack exactly 4000? How do you find out it?
Thank you.</description>
		<content:encoded><![CDATA[<p>Mark, I have one question. Why is size of decode stack exactly 4000? How do you find out it?<br />
Thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Оптимизация графики для веб-страниц &#124; Holder Create Studio Blog</title>
		<link>http://marknelson.us/1989/10/01/lzw-data-compression/comment-page-5/#comment-351440</link>
		<dc:creator>Оптимизация графики для веб-страниц &#124; Holder Create Studio Blog</dc:creator>
		<pubDate>Thu, 10 Mar 2011 18:34:42 +0000</pubDate>
		<guid isPermaLink="false">/1989/10/01/lzw-data-compression/#comment-351440</guid>
		<description>[...] (Graphics Interchange Format) – использует алгоритм сжатия LZW, который значительно уменьшает размеры исходного [...]</description>
		<content:encoded><![CDATA[<p>[...] (Graphics Interchange Format) – использует алгоритм сжатия LZW, который значительно уменьшает размеры исходного [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

