On coding of sources with two-sided geometric distribution using binary decomposition

Summary form only given. We address the problem of entropy coding of integers i/spl isin/Z with a probability distribution defined as the two-sided geometric distribution (TSGD) which arises mainly in tasks of image and video compression. An efficient method based on binary tree decomposition of the source alphabet, combined with binary arithmetic coding, was proposed for coding of DC and AC coefficients of the DCT in the JPEG image compression standard. Binary decomposition allows for efficient coding of sources with large alphabets and skewed distribution. We propose two binary decompositions for coding of sources with the TSGD.