Skip Navigation

The Computer Journal 2004 47(6):701-707; doi:10.1093/comjnl/47.6.701
© 2004 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 (3)
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?

A Branch-and-Bound Algorithm for the Construction of Reversible Variable Length Codes

Hsien-Wen Tseng* and Chin-Chen Chang§

Department of Computer Science and Information Engineering, National Chung Cheng University, Chaiyi, Taiwan 621, R.O.C.

Reversible variable length codes (RVLCs) have been extensively studied. In recent years, many new coding standards such as H.263 MPEG-4 and JPEG-2000 have adopted RVLCs to enhance their error resilient capability. This paper presents a novel algorithm that can construct efficient RVLCs. Distinct from previous Huffman-based schemes, the proposed algorithm employs the branch-and-bound strategy to generate RVLCs. This strategy not only improvesthe coding efficiency but also provides a flexible codeword selection. The experimental results show that the RVLCs obtained by our algorithm outperform all existing RVLCs.

Received 20 February 2003. Revised 31 May 2004.

* Email: hwtseng{at}cs.ccu.edu.tw

§ Email: ccc{at}cs.ccu.edu.tw


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.