Two Algorithms for Constructing Efficient Huffman-code Based Reversible Variable Length Codes
Resource
IEEE Transactions on Communications,56(1),81-89.
Journal
IEEE Transactions on Communications
Pages
2381
Date Issued
2008-01
Date
2008-01
Author(s)
Abstract
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 code words. 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 code word length while Algorithm 2 jointly minimizes the average code word length and maximizes the error-detection probability at the same time.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
index.html
Size
23.24 KB
Format
HTML
Checksum
(MD5):e97eaa920710b86e7189109387ee3c3b