Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Two algorithms for constructing efficient huffman-code based reversible variable length codes
By: Chia-Wei Lin; Ja-Ling Wu; Yuh-Jue Chuang;
2008 / IEEE
This item was taken from the IEEE Periodical ' Two algorithms for constructing efficient huffman-code based reversible variable length codes ' In this paper, Huffman-code based reversible variable length code (RVLC) construction algorithms are studied. We use graph models to represent the prefix, suffix and Hamming distance relationships among RVLC candidate codewords. The properties of the so-obtained graphs are investigated in detail, based on which we present two efficient RVLC construction algorithms: algorithm 1 aims at minimizing the average codeword length while algorithm 2 jointly minimizes the average codeword length and maximizes the error detection probability at the same time.
Communication, Networking And Broadcast Technologies
Error Detection Probability
Huffman-code Based Reversible Variable Length Codes
Hamming Distance Relationships
Average Codeword Length
Mpeg 4 Standard
Variable Length Codes