An error recovery state model for Huffman codes

When a single bit error occurs in the encoded bit stream produced by a Huffman code, there is a finite probability that the decoder will lose synchronization with respect to the encoded bit stream. When synchronization is lost, there is also a finite probability that, for succeeding source symbols, the decoder will regain synchronization to the received bit stream. A state model for the Huffman code error process is developed and a method for determining the state probabilities and the expected number of source symbols lost is presented. The performance of various test codes with respect to error recovery is also discussed.