Title :
Verification of minimum-redundancy prefix codes
Author :
Belal, Ahmed ; Elmasry, Amr
Author_Institution :
Dept. of Comput. Eng. & Syst., Alexandria Univ., Egypt
fDate :
4/1/2006 12:00:00 AM
Abstract :
We show that verifying a given prefix code for optimality requires Ω(nlogn) time, indicating that the verification problem is not asymptotically easier than the construction problem. Alternatively, we give linear-time verification algorithms for several special cases that are either typical in practice or theoretically interesting.
Keywords :
Huffman codes; decision trees; linear codes; redundancy; linear-time verification algorithm; minimum-redundancy prefix code; Binary trees; Codes; Data compression; Helium; NP-hard problem; Polynomials; Systems engineering and theory; Tree graphs; Asymptotic complexity; Huffman codes; lower bounds; optimal codes; verification algorithms;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.871578
