Skip Navigation

The Computer Journal 1972 15(4):308-313; doi:10.1093/comjnl/15.4.308
© 1972 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 (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wells, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

File compression using variable length encodings

M. Wells *

Department of Computational Science and Electronic Computing Laboratory, The University of Leeds, Leeds, UK

Withing a digital system a symbol is represented as a grouping of digits. If the length of this group is variable, rather than fixed, it is theoretically possible to achieve reductions in the total number of digits required to represent a symbol string. This paper discusses some hardware and software techniques for carrying out the encoding and decoding and gives some observations of the economies that might be achieved by their use. The final conclusions are cautiously optimistic.

Received January 1972.

* The work described in this paper was carried out under my supervision by four Final year students in Computational Science at Leeds. It is a pleasure to acknowledge the efforts of Messrs. K. B. Shimman, R. G. Stone, J. W. Taylor and D. Viney.

§ Department of Computational Science and Electronic Computing Laboratory, The University of Leeds, Leeds LS2 9JT


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.