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 an...
详细信息
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 rootcode 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.
暂无评论