Referenced Items are not available for this document.
Variable-to-fixed-length coding implementations, according to the Tunstall algorithm, are shown to be significantly less complex than fixed-to-variable-length coding schemes such as the Huffman scheme. A modified version of Tunstall coding is presented, with improved compression ratio.
Published in:
Electronics Letters
(Volume:28
,
Issue:
15
)
Date of Publication: 16 July 1992
- Page(s):
- 1399 - 1401
- ISSN :
- 0013-5194
- INSPEC Accession Number:
- 4225926
- Digital Object Identifier :
- 10.1049/el:19920890
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- 16 July 1992
- Sponsored by :
- Institution of Engineering and Technology
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
