📄 ewtoc.html
字号:
<!DOCTYPE HTML PUBLIC "html.dtd"><HTML><HEAD><TITLE>The Data Compression Book-:Table of Contents</TITLE><META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW"><SCRIPT><!--function displayWindow(url, width, height) { var Win = window.open(url,"displayWindow",'width=' + width +',height=' + height + ',resizable=1,scrollbars=yes');}//--></SCRIPT></HEAD><BODY BGCOLOR="#FFFFFF" VLINK="#DD0000" TEXT="#000000" LINK="#DD0000" ALINK="#FF0000"><TD WIDTH="540" VALIGN="TOP"><!-- <CENTER><TABLE><TR><TD><FORM METHOD="GET" ACTION="http://search.itknowledge.com/excite/cgi-bin/AT-foldocsearch.cgi"><INPUT NAME="search" SIZE="20" VALUE=""><BR><CENTER><INPUT NAME="searchButton" TYPE="submit" VALUE="Glossary Search"></CENTER><INPUT NAME="source" TYPE="hidden" VALUE="local" CHECKED> <INPUT NAME="bltext" TYPE="hidden" VALUE="Back to Search"><INPUT NAME="sp" TYPE="hidden" VALUE="sp"></FORM></TD><TD><IMG SRC="http://www.itknowledge.com/images/dotclear.gif" WIDTH="15" HEIGHT="1"></TD><TD><FORM METHOD="POST" ACTION="http://search.itknowledge.com/excite/cgi-bin/AT-subscriptionsearch.cgi"><INPUT NAME="search" SIZE="20" VALUE=""><BR><CENTER><INPUT NAME="searchButton" TYPE="submit" VALUE=" Book Search "></CENTER><INPUT NAME="source" TYPE="hidden" VALUE="local" CHECKED> <INPUT NAME="backlink" TYPE="hidden" VALUE="http://search.itknowledge.com:80/excite/AT-subscriptionquery.html"><INPUT NAME="bltext" TYPE="hidden" VALUE="Back to Search"><INPUT NAME="sp" TYPE="hidden" VALUE="sp"></FORM></TD></TR></TABLE></CENTER> --><!-- ISBN=1558514341//--><!-- TITLE=The Data Compression Book-//--><!-- AUTHOR=Mark Nelson//--><!-- PUBLISHER=IDG Books Worldwide, Inc.//--><!-- IMPRINT=M & T Books//--><!-- CHAPTER=0//--><!-- PAGES=0//--><!-- UNASSIGNED1//--><!-- UNASSIGNED2//--><FONT SIZE="-1" FACE="Arial,Helvetica">To access the contents, click the chapter and section titles.</FONT><P><B>The Data Compression Book-</B><A HREF="http://barnesandnoble.bfast.com/booklink/click?sourceid=216514&ISBN=1558514341" TARGET="resource window"><FONT SIZE="-1"><BR><I>(Imprint: M & T Books)</I><BR><I>(Publisher: IDG Books Worldwide, Inc.)</I><BR>Author: Mark Nelson<BR>ISBN: 1558514341</FONT><BR><HR><P><DL><FONT SIZE="4"><B><DD><A HREF="about.html">Afterword</A><DD><A HREF="about_author.html">Why This Book Is For You</A></B></FONT><BR><BR><DD><A HREF="ch01/001-003.html#Heading1"><FONT SIZE="4"><B>Chapter 1—Introduction to Data Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch01/001-003.html#Heading2">The Audience</A><DD><A HREF="ch01/001-003.html#Heading3">Why C?</A><DD><A HREF="ch01/001-003.html#Heading4">Which C?</A><DL><DD><A HREF="ch01/003-005.html#Heading5">Issues in Writing Portable C</A></DL><DD><A HREF="ch01/005-007.html#Heading6">Keeping Score</A><DD><A HREF="ch01/008-010.html#Heading7">The Structure</A></DL></B></FONT><BR><DD><A HREF="ch02/011-014.html#Heading1"><FONT SIZE="4"><B>Chapter 2—The Data-Compression Lexicon, with a History</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch02/011-014.html#Heading2">The Two Kingdoms</A><DD><A HREF="ch02/011-014.html#Heading3">Data Compression = Modeling + Coding</A><DD><A HREF="ch02/011-014.html#Heading4">The Dawn Age</A><DD><A HREF="ch02/014-017.html#Heading5">Coding</A><DL><DD><A HREF="ch02/014-017.html#Heading6">An Improvement</A></DL><DD><A HREF="ch02/017-020.html#Heading7">Modeling</A><DL><DD><A HREF="ch02/017-020.html#Heading8">Statistical Modeling</A><DD><A HREF="ch02/017-020.html#Heading9">Dictionary Schemes</A></DL><DD><A HREF="ch02/020-023.html#Heading10">Ziv and Lempel</A><DL><DD><A HREF="ch02/020-023.html#Heading11">LZ77</A><DD><A HREF="ch02/020-023.html#Heading12">LZ78</A></DL><DD><A HREF="ch02/020-023.html#Heading13">Lossy Compression</A><DD><A HREF="ch02/023-026.html#Heading14">Programs to Know</A></DL></B></FONT><BR><DD><A HREF="ch03/027-029.html#Heading1"><FONT SIZE="4"><B>Chapter 3—The Dawn Age: Minimum Redundancy Coding</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch03/027-029.html#Heading2">The Shannon-Fano Algorithm</A><DD><A HREF="ch03/031-034.html#Heading3">The Huffman Algorithm</A><DD><A HREF="ch03/034-036.html#Heading4">Huffman in C</A><DL><DD><A HREF="ch03/034-036.html#Heading5">BITIO.C</A></DL><DD><A HREF="ch03/043-046.html#Heading6">A Reminder about Prototypes</A><DD><A HREF="ch03/043-046.html#Heading7">MAIN-C.C AND MAIN-E.C</A><DL><DD><A HREF="ch03/050-054.html#Heading8">MAIN-C.C</A><DD><A HREF="ch03/050-054.html#Heading9">ERRHAND.C</A></DL><DD><A HREF="ch03/054-057.html#Heading10">Into the Huffman Code</A><DL><DD><A HREF="ch03/054-057.html#Heading11">Counting the Symbols</A><DD><A HREF="ch03/054-057.html#Heading12">Saving the Counts</A><DD><A HREF="ch03/058-060.html#Heading13">Building the Tree</A><DD><A HREF="ch03/058-060.html#Heading14">Using the Tree</A></DL><DD><A HREF="ch03/060-073.html#Heading15">The Compression Code</A><DD><A HREF="ch03/074-074.html#Heading16">Putting It All Together</A><DL><DD><A HREF="ch03/074-074.html#Heading17">Performance</A></DL></DL></B></FONT><BR><DD><A HREF="ch04/075-078.html#Heading1"><FONT SIZE="4"><B>Chapter 4—A Significant Improvement: Adaptive Huffman Coding</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch04/075-078.html#Heading2">Adaptive Coding</A><DD><A HREF="ch04/075-078.html#Heading3">Updating the Huffman Tree</A><DL><DD><A HREF="ch04/078-083.html#Heading4">What Swapping Does</A><DD><A HREF="ch04/078-083.html#Heading5">The Algorithm</A><DD><A HREF="ch04/078-083.html#Heading6">An Enhancement</A><DD><A HREF="ch04/083-087.html#Heading7">The Escape Code</A><DD><A HREF="ch04/083-087.html#Heading8">The Overflow Problem</A><DD><A HREF="ch04/087-090.html#Heading9">A Rescaling Bonus</A></DL><DD><A HREF="ch04/087-090.html#Heading10">The Code</A><DL><DD><A HREF="ch04/087-090.html#Heading11">Initialization of the Array</A><DD><A HREF="ch04/091-094.html#Heading12">The Compress Main Program</A><DD><A HREF="ch04/091-094.html#Heading13">The Expand Main Program</A><DD><A HREF="ch04/091-094.html#Heading14">Encoding the Symbol</A><DD><A HREF="ch04/094-097.html#Heading15">Updating the Tree</A><DD><A HREF="ch04/097-101.html#Heading16">Decoding the Symbol</A></DL><DD><A HREF="ch04/101-112.html#Heading17">The Code</A></DL></B></FONT><BR><DD><A HREF="ch05/113-115.html#Heading1"><FONT SIZE="4"><B>Chapter 5—Huffman One Better: Arithmetic Coding</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch05/113-115.html#Heading2">Difficulties</A><DD><A HREF="ch05/113-115.html#Heading3">Arithmetic Coding: A Step Forward</A><DL><DD><A HREF="ch05/117-120.html#Heading4">Practical Matters</A><DD><A HREF="ch05/120-123.html#Heading5">A Complication</A><DD><A HREF="ch05/120-123.html#Heading6">Decoding</A><DD><A HREF="ch05/120-123.html#Heading7">Where’s the Beef?</A></DL><DD><A HREF="ch05/123-126.html#Heading8">The Code</A><DL><DD><A HREF="ch05/123-126.html#Heading9">The Compression Program</A><DD><A HREF="ch05/123-126.html#Heading10">The Expansion Program</A><DD><A HREF="ch05/126-128.html#Heading11">Initializing the Model</A><DD><A HREF="ch05/128-130.html#Heading12">Reading the Model</A><DD><A HREF="ch05/128-130.html#Heading13">Initializing the Encoder</A><DD><A HREF="ch05/130-133.html#Heading14">The Encoding Process</A><DD><A HREF="ch05/130-133.html#Heading15">Flushing the Encoder</A><DD><A HREF="ch05/133-136.html#Heading16">The Decoding Process</A></DL><DD><A HREF="ch05/136-152.html#Heading17">Summary</A><DL><DD><A HREF="ch05/136-152.html#Heading18">Code</A></DL></DL></B></FONT><BR><DD><A HREF="ch06/153-154.html#Heading1"><FONT SIZE="4"><B>Chapter 6—Statistical Modeling</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch06/153-154.html#Heading2">Higher-Order Modeling</A><DD><A HREF="ch06/153-154.html#Heading3">Finite Context Modeling</A><DD><A HREF="ch06/155-156.html#Heading4">Adaptive Modeling</A><DL><DD><A HREF="ch06/155-156.html#Heading5">A Simple Example</A><DD><A HREF="ch06/156-159.html#Heading6">Using the Escape Code as a Fallback</A><DD><A HREF="ch06/159-162.html#Heading7">Improvements</A></DL><DD><A HREF="ch06/162-164.html#Heading8">Highest-Order Modeling</A><DL><DD><A HREF="ch06/162-164.html#Heading9">Updating the Model</A><DD><A HREF="ch06/164-166.html#Heading10">Escape Probabilities</A><DD><A HREF="ch06/164-166.html#Heading11">Scoreboarding</A><DD><A HREF="ch06/166-169.html#Heading12">Data Structures</A><DD><A HREF="ch06/169-171.html#Heading13">The Finishing Touches: Tables –1 and –2</A><DD><A HREF="ch06/169-171.html#Heading14">Model Flushing</A><DD><A HREF="ch06/169-171.html#Heading15">Implementation</A></DL><DD><A HREF="ch06/169-171.html#Heading16">Conclusions</A>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -