Modified symmetrical reversible variable-length code and its theoretical bounds

Authors:
Chien-Wu Tsai;Ja-Ling Wu
Affiliations:
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei;-
Venue:
IEEE Transactions on Information Theory
Year:
2001

Citing 0
Cited 3

A fast and simple algorithm for the construction of asymmetrical reversible variable length codes

Real-Time Imaging
Error resilient locally adaptive data compression

Journal of Systems and Software
An A*-based algorithm for constructing reversible variable length codes with minimum average codeword length

IEEE Transactions on Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Reversible variable length codes (RVLCs) have been adopted in emerging video coding standards-H.263+ and MPEG-4-to enhance their error-resilience capabilities (which are important and essential) in error-prone environments. This study proposes an efficient algorithm to construct a symmetrical RVLC from a given Huffman code. In addition, theoretical bounds on the maximum codeword length for fixed-length Huffman codes, and on the optimal average codeword lengths for sources with exponential distribution are provided