Work

Optimal coding for maximum efficiency

Year: 1969
Type: dissertation
Abstract: Various criteria may be generated to evaluate the optimality of a code in a digital communication system. Of these, the three that are most often chosen are minimum time, error and cost in transmitting a message. To date there is an optimal procedure for minimizing the transmission time only. This method is often referred to as coding for time, or efficiency. Although the subject matter of this paper is restricted to coding for efficiency, the concepts that will be developed may serve in solving the yet unsolved problem of optimal coding to minimize error. The first method developed for minimizing the transmission time of a coded message is the Shannon - Fano method. It was developed independently by them in 1948. The optimality of their procedure applies only to special cases. Later in 1952 a general optimal procedure\nwas developed by Huffman. The Huffman method is relatively simple to implement;\nhowever, its nature is quite subtle and is very much obscured in the existing proofs which make use of other individual results, such as the Kraft and MacMillan inequalities. Since the method is basically iterative\nin nature, parameters describing the ensemble code developed by the procedure will be expressed in this paper by recursion formulas. The main contribution was to develop\na simple recurrence relation, show how i??t simplifies the computation of the average length of a code, and finally provide the optimal code and procedure to obtain this code. A similar relation for entropy is developed,\nand by comparison of the two recursion. formulas, a concise justification of the lower bound of the average.
Language: English
Open Access status: green
OpenAlex ID: W2285753454
Cites: 4
Cited by:
Related to: 10