{"title":"一种基于霍夫曼码实现最小冗余的方法","authors":"J. Bhullar, P. Sandhu, M. Gupta","doi":"10.1109/ICCMS.2010.177","DOIUrl":null,"url":null,"abstract":"In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy ‘r’ of any discrete memory less source satisfied, where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.","PeriodicalId":153175,"journal":{"name":"2010 Second International Conference on Computer Modeling and Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Huffman Codes Based Approach to Achieve Minimum Redundancy\",\"authors\":\"J. Bhullar, P. Sandhu, M. Gupta\",\"doi\":\"10.1109/ICCMS.2010.177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy ‘r’ of any discrete memory less source satisfied, where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.\",\"PeriodicalId\":153175,\"journal\":{\"name\":\"2010 Second International Conference on Computer Modeling and Simulation\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer Modeling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCMS.2010.177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMS.2010.177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
在本文中，我们通过减少源字母的冗余引入了更严格的边界。以前，如果源字母的数量很大，并且还提供了任何离散存储器的冗余' r '，其中PN是最不可能的源字母概率，则会发现更清晰的界限。但是我们减少了源字母(N)的冗余到4和5。
A Huffman Codes Based Approach to Achieve Minimum Redundancy
In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy ‘r’ of any discrete memory less source satisfied, where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
