{"title":"Reduced code transmission and high speed reconstruction of Huffman tables","authors":"R. Hashemian, M. Ahmadi","doi":"10.1109/PACRIM.2001.953552","DOIUrl":null,"url":null,"abstract":"A Huffman (1952) code reconstruction technique is presented. It is shown that, based on some unique properties of a particular Huffman coding scheme, called single-side grown Huffman table, only certain codes need to be transmitted to the decoder to reconstruct the entire Huffman table.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2001.953552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A Huffman (1952) code reconstruction technique is presented. It is shown that, based on some unique properties of a particular Huffman coding scheme, called single-side grown Huffman table, only certain codes need to be transmitted to the decoder to reconstruct the entire Huffman table.