Data compression via binary decision diagrams

Abstract

A binary data string of length 2/sup k/ induces a Boolean function of k variables which can be represented by a unique reduced binary decision diagram. We losslessly compress the data string indirectly by compressing this binary decision diagram. The resulting data compression algorithm is universal.