Two algorithms for constructing efficient Huffman-code based reversible variable length codes

Chia Wei Lin; Ja Ling Wu; Yuh Jue Chuang

doi:10.1109/TCOMM.2008.050588

Two algorithms for constructing efficient Huffman-code based reversible variable length codes

Chia Wei Lin^*, Ja Ling Wu, Yuh Jue Chuang

^*Corresponding author for this work

Department of Health Care Management

National Taiwan University

Research output: Contribution to journal › Journal Article › peer-review

9 Scopus citations

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

Original language	English
Pages (from-to)	81-89
Number of pages	9
Journal	IEEE Transactions on Communications
Volume	56
Issue number	1
DOIs	https://doi.org/10.1109/TCOMM.2008.050588
State	Published - 01 2008

Keywords

Error detection coding
Error synchronization
Variable length codes

Access to Document

10.1109/TCOMM.2008.050588

Cite this

@article{177ecabd6f624a249ecb483fb74b6018,

title = "Two algorithms for constructing efficient Huffman-code based reversible variable length codes",

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

keywords = "Error detection coding, Error synchronization, Variable length codes",

author = "Lin, {Chia Wei} and Wu, {Ja Ling} and Chuang, {Yuh Jue}",

year = "2008",

month = jan,

doi = "10.1109/TCOMM.2008.050588",

language = "英语",

volume = "56",

pages = "81--89",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Two algorithms for constructing efficient Huffman-code based reversible variable length codes

AU - Lin, Chia Wei

AU - Wu, Ja Ling

AU - Chuang, Yuh Jue

PY - 2008/1

Y1 - 2008/1

N2 - 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.

AB - 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.

KW - Error detection coding

KW - Error synchronization

KW - Variable length codes

UR - http://www.scopus.com/inward/record.url?scp=39749085947&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2008.050588

DO - 10.1109/TCOMM.2008.050588

M3 - 文章

AN - SCOPUS:39749085947

SN - 0090-6778

VL - 56

SP - 81

EP - 89

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 1

ER -

Two algorithms for constructing efficient Huffman-code based reversible variable length codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this