{"title":"整数表示的自适应通用代码","authors":"Márcio Lima, V. D. Rocha Jr., B. T. Ávila","doi":"10.14209/sbrt.2008.42428","DOIUrl":null,"url":null,"abstract":"— For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the main motivation in this paper to introduce adaptive universal codes based on pattern codes. The construction of a class of adaptive universal codes based on Fibonacci codes is given for integer representation which perform well over a wider range of integer values in comparison to known universal code constructions.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Códigos Universais Adaptativos para Representação de Números Inteiros\",\"authors\":\"Márcio Lima, V. D. Rocha Jr., B. T. Ávila\",\"doi\":\"10.14209/sbrt.2008.42428\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"— For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the main motivation in this paper to introduce adaptive universal codes based on pattern codes. The construction of a class of adaptive universal codes based on Fibonacci codes is given for integer representation which perform well over a wider range of integer values in comparison to known universal code constructions.\",\"PeriodicalId\":340055,\"journal\":{\"name\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14209/sbrt.2008.42428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/sbrt.2008.42428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Códigos Universais Adaptativos para Representação de Números Inteiros
— For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the main motivation in this paper to introduce adaptive universal codes based on pattern codes. The construction of a class of adaptive universal codes based on Fibonacci codes is given for integer representation which perform well over a wider range of integer values in comparison to known universal code constructions.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
