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, ba...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 56; no. 1; pp. 81 - 89
Main Authors: LIN, Chia-Wei, WU, Ja-Ling, CHUANG, Yuh-Jue
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Channel coding
Code standards
Coding, codes
Communications Society
Computer errors
Construction
Decoding
Error correction
Error detection
Exact sciences and technology
Graphs
Hamming distance
Information, signal and communications theory
MPEG 4 Standard
Multimedia communication
Signal and communications theory
Telecommunications and information theory
Video coding
Error detection coding
Hamming distance
Error probability
Algorithm performance
Coding
variable length codes
Huffman code
Error detection
Synchronization
Algorithm
error synchronization
Variable length code
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2008.050588