Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/3682
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Okazaki, Hiroyuki | - |
dc.contributor.author | Futa, Yuichi | - |
dc.contributor.author | Shidama, Yasunari | - |
dc.date.accessioned | 2015-12-09T20:39:35Z | - |
dc.date.available | 2015-12-09T20:39:35Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Formalized Mathematics, Volume 21, Issue 2, 2013, Pages 133-143 | - |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.issn | 1898-9934 | - |
dc.identifier.uri | http://hdl.handle.net/11320/3682 | - |
dc.description | This research was presented during the 2013 International Conference on Foundations of Computer Science FCS’13 in Las Vegas, USA. | - |
dc.description.abstract | Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree. | - |
dc.description.sponsorship | Hiroyuki Okazaki - This work was supported by JSPS KAKENHI 21240001. | - |
dc.description.sponsorship | Yasunari Shidama - This work was supported by JSPS KAKENHI 22300285. | - |
dc.language.iso | en | - |
dc.publisher | De Gruyter Open | - |
dc.subject | formalization of Huffman coding tree | - |
dc.subject | source coding | - |
dc.title | Constructing Binary Huffman Tree | - |
dc.type | Article | - |
dc.identifier.doi | 10.2478/forma-2013-0015 | - |
dc.description.Affiliation | Okazaki Hiroyuki - Shinshu University Nagano, Japan | - |
dc.description.Affiliation | Futa Yuichi - Japan Advanced Institute of Science and Technology Ishikawa, Japan | - |
dc.description.Affiliation | Shidama Yasunari - Shinshu University Nagano, Japan | - |
dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990. | - |
dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. | - |
dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990. | - |
dc.description.references | Grzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990. | - |
dc.description.references | Grzegorz Bancerek. König’s lemma. Formalized Mathematics, 2(3):397-402, 1991. | - |
dc.description.references | Grzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195-204, 1992. | - |
dc.description.references | Grzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993. | - |
dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990. | - |
dc.description.references | Grzegorz Bancerek and Piotr Rudnicki. On defining functions on binary trees. Formalized Mathematics, 5(1):9-13, 1996. | - |
dc.description.references | Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990. | - |
dc.description.references | Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990. | - |
dc.description.references | Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. | - |
dc.description.references | Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. | - |
dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990. | - |
dc.description.references | Krzysztof Hryniewiecki. Recursive definitions. Formalized Mathematics, 1(2):321-328, 1990. | - |
dc.description.references | D. A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E, 1952. | - |
dc.description.references | Andrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990. | - |
dc.description.references | Andrzej Nedzusiak. σ-fields and probability. Formalized Mathematics, 1(2):401-407, 1990. | - |
dc.description.references | Hiroyuki Okazaki and Yasunari Shidama. Probability on finite set and real-valued random variables. Formalized Mathematics, 17(2):129-136, 2009. doi:10.2478/v10037-009-0014-x. | - |
dc.description.references | Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115-122, 1990. | - |
dc.description.references | Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990. | - |
dc.description.references | Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341-347, 2003. | - |
dc.description.references | Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990. | - |
dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. | - |
dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990. | - |
dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2013, Volume 21, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma-2013-0015.pdf | 254,61 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL