
\documentclass{article}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%TCIDATA{OutputFilter=LATEX.DLL}
%TCIDATA{Version=5.00.0.2552}
%TCIDATA{<META NAME="SaveForMode" CONTENT="1">}
%TCIDATA{Created=Saturday, November 26, 2005 21:34:54}
%TCIDATA{LastRevised=Saturday, November 26, 2005 22:04:09}
%TCIDATA{<META NAME="GraphicsSave" CONTENT="32">}
%TCIDATA{<META NAME="DocumentShell" CONTENT="Standard LaTeX\Blank - Standard LaTeX Article">}
%TCIDATA{CSTFile=40 LaTeX article.cst}

\input{tcilatex}

\begin{document}


\begin{center}
Huffman Coding
\end{center}

\bigskip

\begin{enumerate}
\item Optimal code for set of symbols subject to the constraint
that the symbols be coded one at a time
\item coding / decoding is done by a lookup table instantaneously,
uniquely and decodeable, block code
\newline where
\newline instantaneous = each code word can be decoded by itself
\newline block = each source symbol yields a fixed sequence of code
\newline unique = only one way
\item
J source symbols \qquad \qquad \qquad 256 gray levels
\newline \qquad J-2 source reductions \qquad \qquad 254
\newline \qquad J-2 code assignments  \qquad \qquad 254 
\end{enumerate}

\bigskip

\noindent Alternatives are cheaper but not optimal.

\bigskip

\noindent LZW uses interpixel redundancies
\end{document}
