{"title":"通用定变源编码的三阶编码速率新结果","authors":"O. Kosut, L. Sankar","doi":"10.1109/ISIT.2014.6875322","DOIUrl":null,"url":null,"abstract":"Converse and achievable results on the third-order coding rate for universal fixed-to-variable source coding are presented. The authors previously introduced a new universal non-prefix Type Size code for memoryless sources in which codewords lengths are chosen in ascending order of type class sizes. This paper presents a converse on the third-order coding rate for general class of fixed-to-variable codes and proves the optimality of Type Size codes for memoryless sources. The third-order coding rate for a two-stage code is also developed and is shown to be strictly larger than achieved by the Type Size code.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"New results on third-order coding rate for universal fixed-to-variable source coding\",\"authors\":\"O. Kosut, L. Sankar\",\"doi\":\"10.1109/ISIT.2014.6875322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Converse and achievable results on the third-order coding rate for universal fixed-to-variable source coding are presented. The authors previously introduced a new universal non-prefix Type Size code for memoryless sources in which codewords lengths are chosen in ascending order of type class sizes. This paper presents a converse on the third-order coding rate for general class of fixed-to-variable codes and proves the optimality of Type Size codes for memoryless sources. The third-order coding rate for a two-stage code is also developed and is shown to be strictly larger than achieved by the Type Size code.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875322\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New results on third-order coding rate for universal fixed-to-variable source coding
Converse and achievable results on the third-order coding rate for universal fixed-to-variable source coding are presented. The authors previously introduced a new universal non-prefix Type Size code for memoryless sources in which codewords lengths are chosen in ascending order of type class sizes. This paper presents a converse on the third-order coding rate for general class of fixed-to-variable codes and proves the optimality of Type Size codes for memoryless sources. The third-order coding rate for a two-stage code is also developed and is shown to be strictly larger than achieved by the Type Size code.