Family of variable-length codes for adaptive coding

Louis Kerofsky

doi:10.1117/12.449764

7 December 2001 Family of variable-length codes for adaptive coding

Louis Kerofsky

Proceedings Volume 4472, Applications of Digital Image Processing XXIV; (2001) https://doi.org/10.1117/12.449764
Event: International Symposium on Optical Science and Technology, 2001, San Diego, CA, United States

Abstract

We consider the problem of designing variable length codes for large symbol sets. Highly structured codes such as the Golomb codes are often used to reduce the encoding and decoding complexity. This structure can limit the coding efficiency. We use the Golomb codes to construct low complexity codes with improved coding efficiency. The construction can be used to provide codes for adaptive coding.

Citation Download Citation

Louis Kerofsky "Family of variable-length codes for adaptive coding", Proc. SPIE 4472, Applications of Digital Image Processing XXIV, (7 December 2001); https://doi.org/10.1117/12.449764

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available