A method for the construction of fixed and variable length matrix communication code with variable redundancy: An extension work in the light of Huffman code
{"title":"A method for the construction of fixed and variable length matrix communication code with variable redundancy: An extension work in the light of Huffman code","authors":"D. Pal","doi":"10.1109/SECON.2007.342878","DOIUrl":null,"url":null,"abstract":"In this article, Huffman's idea has been extended to higher dimensions and magnitudes with greater redundancy (minimum to maximum) in the development of a new communication code. In this code, both coding and decoding are easier in comparison with Huffman code.","PeriodicalId":423683,"journal":{"name":"Proceedings 2007 IEEE SoutheastCon","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2007 IEEE SoutheastCon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2007.342878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this article, Huffman's idea has been extended to higher dimensions and magnitudes with greater redundancy (minimum to maximum) in the development of a new communication code. In this code, both coding and decoding are easier in comparison with Huffman code.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
