Skip to main content
Have a personal or library account? Click to login
Constructing Binary Huffman Tree Cover

Constructing Binary Huffman Tree

Formalized Mathematics
Volume 21 (2013): Issue 2 (June 2013)
By: ,   and    
Open Access
|Jun 2013
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1():377-382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The fundamental properties of natural numbers., 1():41-46, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. The ordinal numbers., 1():91-96, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek. Introduction to trees., 1():421-427, 1990.
    Search in Google Scholar
  5. [5] Grzegorz Bancerek. K¨onig’s lemma., 2():397-402, 1991.
    Search in Google Scholar
  6. [6] Grzegorz Bancerek. Sets and functions of trees and joining operations of trees., 3():195-204, 1992.
    Search in Google Scholar
  7. [7] Grzegorz Bancerek. Joining of decorated trees., 4():77-82, 1993.
    Search in Google Scholar
  8. [8] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences., 1():107-114, 1990.
    Search in Google Scholar
  9. [9] Grzegorz Bancerek and Piotr Rudnicki. On defining functions on binary trees., 5():9-13, 1996.
    Search in Google Scholar
  10. [10] Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets., 1():529-536, 1990.
    Search in Google Scholar
  11. [11] Czesław Bylinski. Functions and their basic properties., 1(): 55-65, 1990.
    Search in Google Scholar
  12. [12] Czesław Bylinski. Functions from a set to a set., 1():153-164, 1990.
    Search in Google Scholar
  13. [13] Czesław Bylinski. Some basic properties of sets., 1():47-53, 1990.
    Search in Google Scholar
  14. [14] Agata Darmochwał. Finite sets., 1():165-167, 1990.
    Search in Google Scholar
  15. [15] Krzysztof Hryniewiecki. Recursive definitions., 1():321-328, 1990.
    Search in Google Scholar
  16. [16] D. A. Huffman.. Proceedings of the I.R.E, 1952.
    Open DOISearch in Google Scholar
  17. [17] Andrzej Kondracki. Basic properties of rational numbers., 1(): 841-845, 1990.
    Search in Google Scholar
  18. [18] Andrzej Nedzusiak. σ-fields and probability., 1():401-407, 1990.
    Search in Google Scholar
  19. [19] Hiroyuki Okazaki and Yasunari Shidama. Probability on finite set and real-valued random variables., 17():129-136, 2009. doi:10.2478/v10037-009-0014-x.
    Open DOISearch in Google Scholar
  20. [20] Andrzej Trybulec. Domains and their Cartesian products., 1(): 115-122, 1990.
    Search in Google Scholar
  21. [21] Andrzej Trybulec. Binary operations applied to functions., 1 ():329-334, 1990.
    Search in Google Scholar
  22. [22] Andrzej Trybulec. On the sets inhabited by numbers., 11(): 341-347, 2003.
    Search in Google Scholar
  23. [23] Michał J. Trybulec. Integers., 1():501-505, 1990.
    Search in Google Scholar
  24. [24] Zinaida Trybulec. Properties of subsets., 1():67-71, 1990.
    Search in Google Scholar
  25. [25] Edmund Woronowicz. Relations and their basic properties., 1 ():73-83, 1990.
    Search in Google Scholar
  26. [26] Edmund Woronowicz. Relations defined on sets., 1():181-186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/forma-2013-0015 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 133 - 143
Published on: Jun 1, 2013
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Keywords:
formalization of Huffman coding tree,
source coding
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2013 Hiroyuki Okazaki, Yuichi Futa, Yasunari Shidama, published by University of Białystok
This work is licensed under the Creative Commons License.

Volume 21 (2013): Issue 2 (June 2013)
Previous article
Next article