Impact of selection of source coding technique on the efficiency

An experimental comparison of a number of different source coding algorithms is carried out. The performance comparison of the Shannon, Shannon-Fano and Huffman coding for binary and tertiary has been done in this paper. Comparison of Average Lengths, Entropies and Efficiencies of code words generated by these algorithms for binary and ternary are presented.

[1]  C. L. Chen.  On a (145, 32) binary cyclic code , 1999, IEEE Trans. Inf. Theory.

[2]  Mina Sartipi,et al.  Source and channel coding in wireless sensor networks using LDPC codes , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[3]  B. John Oommen,et al.  Enhanced static Fano coding , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[4]  Neri Merhav,et al.  Universal coding for arbitrarily varying sources , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[5]  T.A. Gulliver,et al.  The overall performance of the Shannon code , 2008, 2008 International Symposium on Information Theory and Its Applications.

[6]  Mamta Sharma,et al.  Compression Using Huffman Coding , 2010 .

[7]  H. Koga.  New coding theorems for fixed-length source coding and Shannon's cipher system with a general source , 2008, 2008 International Symposium on Information Theory and Its Applications.

[8]  Lars Wanhammar,et al.  High speed pipelined parallel Huffman decoding , 1997, Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97.

[9]  Fady Alajaji,et al.  Optimistic Shannon coding theorems for arbitrary single-user systems , 1999, IEEE Trans. Inf. Theory.