{"title":"Tunstall编码误差性能的研究","authors":"J. A. Briffa, Victor Buttigieg","doi":"10.1109/ISIT.1998.708803","DOIUrl":null,"url":null,"abstract":"The error performance of the Tunstall code is analysed, and a relevant metric defined. Several parameters in the encoding process are considered, with the objective of minimising the effect of errors without sacrificing compression. The results obtained show that the error performance may be significantly improved without loss of compression.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Investigation of the error performance of Tunstall coding\",\"authors\":\"J. A. Briffa, Victor Buttigieg\",\"doi\":\"10.1109/ISIT.1998.708803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The error performance of the Tunstall code is analysed, and a relevant metric defined. Several parameters in the encoding process are considered, with the objective of minimising the effect of errors without sacrificing compression. The results obtained show that the error performance may be significantly improved without loss of compression.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Investigation of the error performance of Tunstall coding
The error performance of the Tunstall code is analysed, and a relevant metric defined. Several parameters in the encoding process are considered, with the objective of minimising the effect of errors without sacrificing compression. The results obtained show that the error performance may be significantly improved without loss of compression.