data structures – RRR compression

I am trying to understand the paper: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets (https://arxiv.org/abs/0705.0552) but have really difficult time understanding it. I would like to apply this on a Bloom filter, but first need to understand how it’s done and its complexities.
Can someone give an example on how to do an RRR compression of a simple bit vector like: 0011010111000 ?