Introduction:

Preliminaries; Miscellany; Some Probability; Matrices

1. An Introduction to Codes

Strings and Things; What are codes? Uniquely Decipherable Codes;

Instantaneous Codes and Kraft's Theorem

2. Efficient Encoding

Information Sources; Average Codeword Length; Huffman Encoding; The

Proof that Huffman Encoding is the Most Efficient

3. Noiseless Coding

Entropy; Properties of Entropy; Extensions of an Information 1= Source; The Noiseless Coding Theorem

II Coding Theory

4. The Main Coding Theory Problem

Communications Channels; Decision Rules; Nearest Neighbor Decoding;