Performance analysis of source coding techniques

Abstract

In this paper the performance of different source coding techniques is analyzed by considering same set of probabilities for all the algorithms for binary, tertiary and quarternary. The algorithms used are Shannon, Shannon Fano and Huffman coding algorithms. Performance of these algorithms is analyzed in terms of average length, entropy and efficiency.