Journal article

Unary-Prefixed Encoding of the Lengths of Consecutive Zeros in a Bit Vector


No matching items found.

Research Areas

No matching items found.

Publication Details

Author list: Oelmann, Bengt;Xue, Shang

Publication year: 2005

Start page: 346

End page: 347

Number of pages: 2

ISSN: 0013-5194


View additional information: View in Web of Science


A unary-prefixed encoding (UPE) algorithm for coding the lengths of zeros in a bit vector is proposed. While the lengths of consecutive zeros in a bit vector can be mapped to integer sources with a geometrical distribution (when the bits in the bit vector are independent of each other), the actual case, in a real-world situation, is more often that the distributions are exponential, with high peaks and heavier tails (when the bits in a bit vector are correlated). For the geometric distribution, the UPE code set can be proven to be optimal. For integer sources with high peaks and heavier tails, the UPE almost always provides better compression compared to existing suboptimal codes.


No matching items found.


No matching items found.


No matching items found.