Extended Golomb codes for binary Markov sources

Abstract

Summary form only given. Elementary Golomb codes have been widely used for compressing correlated binary sources. We study the theoretical bit-rate performance of two different Golomb coding methods on binary Markov sources: the sequential coding method, and the interleaved coding method. Although the theoretical bit-rate performance for these codes on on i.i.d. sources is known, to the best of our knowledge, theoretical performance results for elementary Golomb codes on correlated Markov sources have not been published.