An A-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length

Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an inherent problem with a VLC is that an error of even one bit can cause serious error propagation and thus loss of synchronization at the receiver,...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 58; no. 11; pp. 3175 - 3185
Main Authors Yuh-Ming Huang, Ting-Yi Wu, Han, Yunghsiang S
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.11.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0090-6778
1558-0857
DOI10.1109/TCOMM.2010.091710.0901872

Cover

Abstract Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an inherent problem with a VLC is that an error of even one bit can cause serious error propagation and thus loss of synchronization at the receiver, which would lead to a series of non-correctly decoded symbols. Reversible variable length codes (RVLCs) were introduced to significantly mitigate this phenomenon. In this work, a method to find an optimal RVLC in terms of the minimum average codeword length is first formulated as a tree-searching problem, and then, instead of performing an exhaustive search, an A*-based construction algorithm is proposed to find an optimal RVLC. The proposed algorithm has been applied to several benchmarks for sources and has found respective optimal symmetric and asymmetric RVLCs.
AbstractList Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an inherent problem with a VLC is that an error of even one bit can cause serious error propagation and thus loss of synchronization at the receiver, which would lead to a series of non-correctly decoded symbols. Reversible variable length codes (RVLCs) were introduced to significantly mitigate this phenomenon. In this work, a method to find an optimal RVLC in terms of the minimum average codeword length is first formulated as a tree-searching problem, and then, instead of performing an exhaustive search, an A*-based construction algorithm is proposed to find an optimal RVLC. The proposed algorithm has been applied to several benchmarks for sources and has found respective optimal symmetric and asymmetric RVLCs.
Author Yuh-Ming Huang
Ting-Yi Wu
Han, Yunghsiang S
Author_xml – sequence: 1
  surname: Yuh-Ming Huang
  fullname: Yuh-Ming Huang
  email: ymhuang@csie.ncnu.edu.tw
  organization: Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Puli, Taiwan
– sequence: 2
  surname: Ting-Yi Wu
  fullname: Ting-Yi Wu
  email: mavericktywu@gmail.com
  organization: Dept. of Electr. Eng., Nat. Chiao-Tung Univ., Hsinchu, Taiwan
– sequence: 3
  givenname: Yunghsiang S
  surname: Han
  fullname: Han, Yunghsiang S
  email: yshan@mail.ntust.edu.tw
  organization: Dept. of Electr. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23387246$$DView record in Pascal Francis
BookMark eNqNkUtv1DAUhS1UJKaFX8DGCCFWKdexHScrlI54STOqhApb6yZ2pi6JXeyEin-P56EuumLj62t_59i655yc-eAtIW8YXDIGzYeb9fV2e1lC7qFh6lCA1ap8RlZMyrqAWqozsoJ8XFRK1S_IeUp3ACCA8xX51XraFleYrKHtuAvRzbcTHUKk6-DTHJd-dn5Hv9s_NibXjZb-xOhwv9lYv5tvM2dsog9ZR7fOu2mZaJth3NnD1UOI5oS-JM8HHJN9daoX5MfnTzfrr8Xm-su3dbspeq7YnFdTIipTIdiuY6ZRfQPCdgZZZYwoRaeQoZK2rjoJZSPUUBlpSoaD7ITh_IK8P_rex_B7sWnWk0u9HUf0NixJ1yJrBIgmk2-fkHdhiT5_TjPgkAcoSpWpdycKU4_jENH3Lun76CaMf3XJeZ63qDLXHLk-hpSiHR4RBnqflj6kpfdp6WNa-pRW1n58ou3djLMLfo7oxv9yeH10cNbax5elbIAzyf8Bclqmpg
CODEN IECMBT
CitedBy_id crossref_primary_10_1109_TIT_2014_2330839
crossref_primary_10_1109_TIT_2015_2417173
crossref_primary_10_1109_TCOMM_2015_2475264
crossref_primary_10_1109_TIT_2015_2425405
crossref_primary_10_1109_TIT_2012_2189433
crossref_primary_10_1109_TIT_2012_2196490
crossref_primary_10_1109_TIT_2014_2338052
crossref_primary_10_1109_TIT_2023_3253843
crossref_primary_10_1016_j_eswa_2022_118358
crossref_primary_10_1109_TCOMM_2012_072412_110706
crossref_primary_10_1109_TCOMM_2020_3024192
crossref_primary_10_1109_TIT_2013_2280211
crossref_primary_10_3390_e17031379
crossref_primary_10_1109_TCOMM_2024_3355315
crossref_primary_10_1109_TCOMM_2014_2329478
crossref_primary_10_1109_TCOMM_2013_072913_120564
crossref_primary_10_1186_s13638_015_0351_0
Cites_doi 10.1109/LCOMM.2003.815660
10.1109/TCOMM.2004.823568
10.1109/ITA.2009.5044962
10.1109/TCOMM.2008.050588
10.1109/18.945265
10.1109/26.950335
10.1109/TCOMM.2005.847151
10.1109/JRPROC.1952.273898
10.1109/LCOMM.2008.080561
10.1109/LSP.2005.861594
10.1109/18.259636
10.1109/LCOMM.2004.837645
10.1109/TCOMM.2009.07.070570
10.1109/TIT.1971.1054638
10.1093/comjnl/47.6.701
10.1016/j.comcom.2003.10.016
10.1109/ISIT.2005.1523774
10.1109/DCC.2010.22
10.1109/26.380026
10.1093/comjnl/46.1.100
10.1109/LCOMM.2002.802041
10.1109/DCC.2009.39
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2010
Copyright_xml – notice: 2015 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2010
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SP
8FD
L7M
F28
FR3
DOI 10.1109/TCOMM.2010.091710.0901872
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Engineering Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EISSN 1558-0857
EndPage 3185
ExternalDocumentID 2724176841
23387246
10_1109_TCOMM_2010_091710_0901872
5590315
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
ZCA
ZCG
AAYXX
CITATION
IQODW
RIG
7SP
8FD
L7M
F28
FR3
ID FETCH-LOGICAL-c371t-c3d2aa7d6a0ebb1d97c904ebda16dd424b7a1a75e86b502947f6d5d21af5b4d33
IEDL.DBID RIE
ISSN 0090-6778
IngestDate Sun Sep 28 11:41:30 EDT 2025
Mon Jun 30 06:21:22 EDT 2025
Mon Jul 21 09:15:08 EDT 2025
Wed Oct 01 00:48:13 EDT 2025
Thu Apr 24 22:57:59 EDT 2025
Wed Aug 27 02:49:09 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 11
Keywords Performance evaluation
A algorithm
reversible variable length codes
Source coding
Data transmission
Transmission loss
Growth of error
Synchronization
Algorithm
Variable length code
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c371t-c3d2aa7d6a0ebb1d97c904ebda16dd424b7a1a75e86b502947f6d5d21af5b4d33
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 1030155427
PQPubID 85472
PageCount 11
ParticipantIDs pascalfrancis_primary_23387246
proquest_miscellaneous_849474049
crossref_citationtrail_10_1109_TCOMM_2010_091710_0901872
ieee_primary_5590315
proquest_journals_1030155427
crossref_primary_10_1109_TCOMM_2010_091710_0901872
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2010-11-01
PublicationDateYYYYMMDD 2010-11-01
PublicationDate_xml – month: 11
  year: 2010
  text: 2010-11-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on communications
PublicationTitleAbbrev TCOMM
PublicationYear 2010
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
palshikar (ref20) 2005
rich (ref21) 1991
pearl (ref23) 1984
ref11
ref2
ref1
ref17
ref16
ref19
gilbert (ref18) 1971; 17
lin (ref8) 2002
ref24
ref26
ref25
ref22
jeong (ref10) 2004
ref27
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref4
  doi: 10.1109/LCOMM.2003.815660
– ident: ref25
  doi: 10.1109/TCOMM.2004.823568
– ident: ref11
  doi: 10.1109/ITA.2009.5044962
– ident: ref6
  doi: 10.1109/TCOMM.2008.050588
– year: 2005
  ident: ref20
  article-title: Satisfying the satisfiability problem
  publication-title: Dr Dobb's J
– ident: ref2
  doi: 10.1109/18.945265
– ident: ref3
  doi: 10.1109/26.950335
– ident: ref26
  doi: 10.1109/TCOMM.2005.847151
– ident: ref24
  doi: 10.1109/JRPROC.1952.273898
– ident: ref15
  doi: 10.1109/LCOMM.2008.080561
– start-page: 968
  year: 2002
  ident: ref8
  article-title: Generic construction algorithm for symmetric and asymmetric RVLCs
  publication-title: IEEE Int Conf Commun Syst
– ident: ref27
  doi: 10.1109/LSP.2005.861594
– ident: ref22
  doi: 10.1109/18.259636
– year: 1984
  ident: ref23
  publication-title: Heuristics Intelligent Search Strategies for Computer Problem Solving
– ident: ref5
  doi: 10.1109/LCOMM.2004.837645
– ident: ref17
  doi: 10.1109/TCOMM.2009.07.070570
– volume: 17
  start-page: 304
  year: 1971
  ident: ref18
  article-title: Codes based on inaccurate source probabilities
  publication-title: IEEE Trans Inf Theory
  doi: 10.1109/TIT.1971.1054638
– year: 1991
  ident: ref21
  publication-title: Artificial Intelligence
– start-page: 817
  year: 2004
  ident: ref10
  article-title: Design of reversible variable-length codes using properties of the Huffman code and average length function
  publication-title: Proceedings IEEE Intl Conf Image Proc
– ident: ref9
  doi: 10.1093/comjnl/47.6.701
– ident: ref16
  doi: 10.1016/j.comcom.2003.10.016
– ident: ref14
  doi: 10.1109/ISIT.2005.1523774
– ident: ref19
  doi: 10.1109/DCC.2010.22
– ident: ref1
  doi: 10.1109/26.380026
– ident: ref7
  doi: 10.1093/comjnl/46.1.100
– ident: ref13
  doi: 10.1109/LCOMM.2002.802041
– ident: ref12
  doi: 10.1109/DCC.2009.39
SSID ssj0004033
Score 2.1097996
Snippet Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 3175
SubjectTerms A algorithm
Algorithms
Applied sciences
Asymmetry
Binary trees
Coding, codes
Compressing
Construction
Construction industry
Encoding
Errors
Exact sciences and technology
Information, signal and communications theory
Optimization
reversible variable length codes
Search problems
Signal and communications theory
Source coding
Synchronization
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transform coding
Transmission and modulation (techniques and equipments)
Upper bound
Title An A-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length
URI https://ieeexplore.ieee.org/document/5590315
https://www.proquest.com/docview/1030155427
https://www.proquest.com/docview/849474049
Volume 58
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-0857
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004033
  issn: 0090-6778
  databaseCode: RIE
  dateStart: 19720101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB61PSA48CqoW0plJI5kmzhOnBxDRVUhAhJqUW-RH5PtqrtZ1M0KiV_P2PEGChx6SSLZVh7fxDNjz8wH8DZBTWoUMZK5aCNhlIrK3KjIZCrRhTBp6pnn6s_5-aX4eJVd7cC7MRcGEX3wGU7dpd_LtyuzcUtlJ2T9OlKCXdiVRT7kav3OgYzTUHHShbPL4gG8CfU0Ty5Ov9R1iOIi78SfHBcdv6OLPLmKC41Ua_o67UBr8c8M7dXO2ROotw88RJvcTDe9npqff9VyvO8bPYXHwf5k1SAwz2AHu-fw6I-qhPtwU3Wsit6TerOsWsxWt_P-esnIuGWO3XOoN9vN2Ff0ER16gewbOdwuBYt9wm7WX1M_i2vmlnhZPe_my82SVdSZpi7f9IMc3tD1BVyefbg4PY8CJ0NkUpn0dLRcKWlzFaPWiS2lKWOB2qokt1ZwoaVKlMywyHUW81LINreZ5YlqMy1smr6EvW7V4QEwmVipeGI0magibnlZ6FKXIpNSZRnadgLFFp3GhILljjdj0XjHJS4bD2zjgG0GYJsA7AT4OPT7ULXjPoP2HUDjgIDNBI7viMTYzsm7l1zkEzjaykgTJoB149jbnKnG5QTY2Ey_rtuPUR2uNuumEPR5BLloh_-_8yt46GMVfObjEewRwPiaTKBeH3vZ_wVcogCI
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB6VIvE48GpRA6UYiSPZJo4dJ8dQUS2wKRLaot4sv7JddTdbsVkh8euxHW-gwKGXJJJtJfFne2bsmfkA3qZGWjFqTMxy0sRECRGXuRKxoiKVBVFZ5pnn6rN8fE4-XdCLHXg3xMIYY7zzmRm5R3-Wr1dq47bKjq3260gJ7sBdSgihfbTW7yjIJAs5J51DOyvuwZuQUfN4evKlroMfl7VP_M2x0eEb0sjTqzjnSLG2_dP0xBb_rNFe8Jw-hnr7yb2_ydVo08mR-vlXNsfb_tMTeBQ0UFT1Q-Yp7Jj2GTz8Iy_hHlxVLari91bAaVQtZqvv8-5yiax6ixy_Z59xtp2hr8b7dMiFQd-sye2CsNDEtLPu0tbTZo3cJi-q5-18uVmiyla2i5cv-mFN3lB1H85PP0xPxnFgZYhVxtLOXjUWgulcJEbKVJdMlQkxUos015pgIplIBaOmyCVNcElYk2uqcSoaKonOsuew265acwCIpZoJnCpplVSSNLgsZClLQhkTlBrdRFBs0eEqpCx3zBkL7k2XpOQeWO6A5T2wPAAbAR6aXvd5O27TaM8BNDQI2ERwdGNIDOXY2vcMkzyCw-0Y4WEJWHPH3-aUNcwiQEOxnbzuREa0ZrVZ84LY7iHWSHvx_ze_hvvjaT3hk49nn1_CA--54OMgD2HXgm1eWYWok0d-HvwC7SYD1Q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+A-Based+Algorithm+for+Constructing+Reversible+Variable+Length+Codes+with+Minimum+Average+Codeword+Length&rft.jtitle=IEEE+transactions+on+communications&rft.au=Huang%2C+Yuh-Ming&rft.au=Wu%2C+Ting-Yi&rft.au=Han%2C+Yunghsiang+S&rft.date=2010-11-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=58&rft.issue=11&rft.spage=3175&rft_id=info:doi/10.1109%2FTCOMM.2010.091710.0901872&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2724176841
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon