Skip Navigation

The Computer Journal 2005 48(3):315-322; doi:10.1093/comjnl/bxh079
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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Perkins, S.
Right arrow Articles by Smith, D. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Robust Data Compression: Variable Length Codes and Burst Errors

S. Perkins * and D. H. Smith

Division of Mathematics and Statistics, University of Glamorgan, Pontypridd CF37 1DL, Wales, UK

When variable length codes are used in the presence of error, slippage can occur. The number of symbols decoded before synchronization is regained can differ from the number of encoded symbols, causing misinterpretation of data. In previous work certain synchronization schemes have been shown to be satisfactory in preventing permanent loss of synchronization and slippage in the presence of random error. In this paper we demonstrate that these schemes can also be satisfactory in the presence of burst errors, and that their relative merits remain the same.

Received 6 October 2004. revised 4 October 2004.

* Email: sperkins{at}glam.ac.uk


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.