DocumentCode
355857
Title
Data compression via binary decision diagrams
Author
Kieffer, John ; Flajolet, Philippe ; Yang, En-Hui
Author_Institution
Minnesota Univ., Minneapolis, MN, USA
fYear
2000
fDate
2000
Firstpage
296
Abstract
A binary data string of length 2k 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
Keywords
Boolean functions; data compression; decision theory; source coding; Boolean function; coding; data string; reduced binary decision diagram; universal data compression algorithm; Binary decision diagrams; Boolean functions; Compression algorithms; Data compression; Data structures; Decoding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866594
Filename
866594
Link To Document