Skip Navigation

The Computer Journal 2003 46(1):100-105; doi:10.1093/comjnl/46.1.100
© 2003 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tseng, H.-W.
Right arrow Articles by Chang, C.-C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Construction of Symmetrical Reversible Variable Length Codes Using Backtracking

Hsien-Wen Tseng1 and Chin-Chen Chang1

1 Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan, Republic of China Email: ccc@cs.ccu.edu.tw

Many coding standards, such as JPEG, H.261, H.263, MPEG-1, MPEG-2, use variable length code (VLC) as their entropy coding strategy. However, VLCs have a big drawback when transmitting over a noisy channel. This drawback is an error propagation problem. For this reason, reversible variable length codes (RVLCs) have been used to enhance the error resilient capabilities of VLC. This paper presents a new algorithm using backtracking that can construct symmetrical RVLCs. Depth first node generation is applied to this algorithm and a bounding function is used to replace nodes with their symmetrical children. The experimental results show that our algorithm can generate better codes than those of previous methods. In addition, our proposed algorithm provides a shorter maximum code length. The shorter maximum code length can usually achieve more efficient decoding.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.