In this chapter we consider basic notions of coding theory. After introducing the notions of prefix and uniquely decodable codes (section 12.1) we prove the classical Kraft–McMillan inequality, a necessary and sufficient condition for the existence of a uniquely decodable code with given lengths of code words (section 12.2). Then (section 12.3) we discuss an algorithm that allows us to find an optimal uniquely decodable code for given letter frequencies. Finally, we discuss lower and upper bounds for the effectiveness of the optimal code (section 12.4).
KeywordsBinary String Code Length Code Word Optimal Code Huffman Code
Unable to display preview. Download preview PDF.