{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
