The Huffman Tree Problem with Unit Step Functions-Reference-Cited by-同舟云学术

The Huffman Tree Problem with Unit Step Functions

Published:2015 Issue:6 Volume:E98.A Page:1189-1196
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

FUJIWARA Hiroshi¹,NAKAMURA Takuya²,FUJITO Toshihiro²

Affiliation:

1. Department of Computer Science & Engineering, Shinshu University

2. Department of Computer Science and Engineering, Toyohashi University of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/6/E98.A_1189/_pdf

Reference5 articles.

1. [1] L.L. Larmore and D.S. Hirschberg, “Length-limited coding,” Proc. SODA '90, pp.310-318, 1990.

2. [2] H. Fujiwara and T. Jacobs, “On the huffman and alphabetic tree problem with general cost functions,” Algorithmica, vol.69, no.3, pp.582-604, 2014.

3. [3] D.A. Huffman, “A method for the construction of minimum-redundancy codes,” Proc. Institute of Radio Engineers, pp.1098-1101, 1952.

4. [4] L.L. Larmore and T.M. Przytycka, “A fast algorithm for optimum height-limited alphabetic binary trees,” SIAM J. Comput., vol.23, pp.1283-1312, 1994.

5. [5] L.G. Kraft, A device for quantizing, grouping, and coding amplitude modulated pulses, Master's thesis, Massachusetts Institute of Technology, 1949.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Huffman Tree Problem with Upper-Bounded Linear Functions;IEICE Transactions on Information and Systems;2022-03-01