Efficient Decoding of Lexicographical Rank in Binary Combinatorial Coding

In this paper, we present a method that reduces the decoding complexity of an entropy encoding technique, namely, combinatorial coding, in order to increase compression efficiency without suffering from intolerable decoding latency. Performance of the proposed method is empirically evaluated on randomly generated bit strings for variable lengths and Hamming weights. As a result, it is made possible that combinatorial coding may practically be applied in larger sized blocks, producing higher throughput than the naive implementation.