Coding and transmission of non uniform alphabets

Abstract

Algorithms for Huffman encoding and ·decoding that would minimize the encoding and decoding times and also increase the transmission rate are developed and tested. The algorithms are employed for compression and decompression of text and image files and real time transmission of text files. It is demonstrated that the encoding produces average code lengths that are nearly equal to the theoretical limit represented by the entropy of the source and hence resulting in improved compression ratio and transmission rate.