{"title":"On Minimum-Redundancy Fix-Free Codes","authors":"S. Savari","doi":"10.1109/DCC.2009.39","DOIUrl":null,"url":null,"abstract":"Fix-free codes are variable length codes in which no codeword is the prefix or suffix of another codeword. They are used in video compression standards because their property of efficient decoding in both the forward and backward directions assists with error resilience. This property also potentially halves the average search time for a string in a compressed file relative to unidirectional variable length codes. Relatively little is known about minimum-redundancy fix-free codes, and we describe some characteristics of and observations about such codes. We introduce a new heuristic to produce fix-free codes which is influenced by these ideas. The design of minimum-redundancy fix-free codes is an example of a constraint processing problem, and we offer the first approach to constructing them and a variation with an additional symmetry requirement.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2009.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
Fix-free codes are variable length codes in which no codeword is the prefix or suffix of another codeword. They are used in video compression standards because their property of efficient decoding in both the forward and backward directions assists with error resilience. This property also potentially halves the average search time for a string in a compressed file relative to unidirectional variable length codes. Relatively little is known about minimum-redundancy fix-free codes, and we describe some characteristics of and observations about such codes. We introduce a new heuristic to produce fix-free codes which is influenced by these ideas. The design of minimum-redundancy fix-free codes is an example of a constraint processing problem, and we offer the first approach to constructing them and a variation with an additional symmetry requirement.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
