减少代码传输和霍夫曼表的高速重建

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI:10.1109/PACRIM.2001.953552

R. Hashemian, M. Ahmadi

{"title":"减少代码传输和霍夫曼表的高速重建","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":"{\"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}","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

摘要

提出了霍夫曼(1952)代码重构技术。研究表明，基于一种称为单边生长霍夫曼表的特殊霍夫曼编码方案的一些独特性质，只需要将某些编码传输到解码器即可重建整个霍夫曼表。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reduced code transmission and high speed reconstruction of Huffman tables

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)

自引率

0.00%

发文量