{"title":"基于t码递归构造字典方法的数据压缩","authors":"K. Hamano, Hirosuke Yamamoto","doi":"10.1109/DCC.2010.68","DOIUrl":null,"url":null,"abstract":"We propose a new data compression scheme based on T-codes [3] using a dictionary method such that all phrases added to a dictionary have a recursive structure similar to T-codes. Our scheme can compress the Calgary Corpus more efficiently than known schemes based on T-codes [2] and the UNIX compress, a variant of LZ78.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes\",\"authors\":\"K. Hamano, Hirosuke Yamamoto\",\"doi\":\"10.1109/DCC.2010.68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new data compression scheme based on T-codes [3] using a dictionary method such that all phrases added to a dictionary have a recursive structure similar to T-codes. Our scheme can compress the Calgary Corpus more efficiently than known schemes based on T-codes [2] and the UNIX compress, a variant of LZ78.\",\"PeriodicalId\":299459,\"journal\":{\"name\":\"2010 Data Compression Conference\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2010.68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2010.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes
We propose a new data compression scheme based on T-codes [3] using a dictionary method such that all phrases added to a dictionary have a recursive structure similar to T-codes. Our scheme can compress the Calgary Corpus more efficiently than known schemes based on T-codes [2] and the UNIX compress, a variant of LZ78.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
