通过二进制决策图进行数据压缩

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) Pub Date : 2000-06-25 DOI:10.1109/ISIT.2000.866594

J. Kieffer, Philippe Flajolet, E. Yang

{"title":"通过二进制决策图进行数据压缩","authors":"J. Kieffer, Philippe Flajolet, E. Yang","doi":"10.1109/ISIT.2000.866594","DOIUrl":null,"url":null,"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.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Data compression via binary decision diagrams\",\"authors\":\"J. Kieffer, Philippe Flajolet, E. Yang\",\"doi\":\"10.1109/ISIT.2000.866594\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2000.866594\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

一个长度为2/sup k/的二进制数据串可以导出一个包含k个变量的布尔函数，该布尔函数可以用一个唯一的约简二进制决策图来表示。通过对二元决策图的压缩，间接地对数据串进行了无损压缩。得到的数据压缩算法是通用的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Data compression via binary decision diagrams

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)

自引率

0.00%

发文量