{"title":"关于二进制字母代码","authors":"D. Sheinwald","doi":"10.1109/DCC.1992.227470","DOIUrl":null,"url":null,"abstract":"Binary alphabetical codes, which are prefix free, fixed-to-variable binary codes for discrete memoryless sources, in which the lexicographic order of the codewords agrees with the alphabet order of the respective source letters, are studied. A necessary and sufficient condition on the sequence of codeword length of any such code is proved. A new upper bounds on the redundancy of alphabetical codes relative to the optimal prefix free, fixed-to-variables codes-the Huffman codes-is proved. An adaptation of the Ziv-Lempel algorithm making it lexicographic order preserving, without any additional redundancy, is presented.<<ETX>>","PeriodicalId":170269,"journal":{"name":"Data Compression Conference, 1992.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On binary alphabetical codes\",\"authors\":\"D. Sheinwald\",\"doi\":\"10.1109/DCC.1992.227470\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary alphabetical codes, which are prefix free, fixed-to-variable binary codes for discrete memoryless sources, in which the lexicographic order of the codewords agrees with the alphabet order of the respective source letters, are studied. A necessary and sufficient condition on the sequence of codeword length of any such code is proved. A new upper bounds on the redundancy of alphabetical codes relative to the optimal prefix free, fixed-to-variables codes-the Huffman codes-is proved. An adaptation of the Ziv-Lempel algorithm making it lexicographic order preserving, without any additional redundancy, is presented.<<ETX>>\",\"PeriodicalId\":170269,\"journal\":{\"name\":\"Data Compression Conference, 1992.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Data Compression Conference, 1992.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1992.227470\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Compression Conference, 1992.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1992.227470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Binary alphabetical codes, which are prefix free, fixed-to-variable binary codes for discrete memoryless sources, in which the lexicographic order of the codewords agrees with the alphabet order of the respective source letters, are studied. A necessary and sufficient condition on the sequence of codeword length of any such code is proved. A new upper bounds on the redundancy of alphabetical codes relative to the optimal prefix free, fixed-to-variables codes-the Huffman codes-is proved. An adaptation of the Ziv-Lempel algorithm making it lexicographic order preserving, without any additional redundancy, is presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
