By Topic

Extended Golomb Code for Integer Representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Somasundaram ; Dept. of Comput. Sci. & Applications, Gandhigram Rural Inst. ; S. Domnic

In this paper, we have proposed two methods to represent nonnegative integers based on the principle used in Golomb code (GC). In both methods, the given integer is successively divided with a divisor, the quotient and the remainders are then used to represent the integer. One of our methods is best suited for representing short integers and gives bit length comparable to that of Elias radic code which is best for representing short-range integers. Another of our methods is best suited for representing both short and long integers and gives a bit length comparable to that of Fibonacci code which is best for representing long integers. Application of our methods as a final stage encoder of the Burrows-Wheeler transform compressor shows that our codes give a better compression rate than the Elias, Fibonacci, punctured, and GC codes

Published in:

IEEE Transactions on Multimedia  (Volume:9 ,  Issue: 2 )