REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

  1. Repozytorium Uniwersytetu w Białymstoku
  2. Czasopisma naukowe / Journals
  3. Formalized Mathematics
  4. Formalized Mathematics, 2013, Volume 21, Issue 2

Szukanie zaawansowane
  • Zespoły i Kolekcje


  • Zaloguj się
  • Zarejestruj się
  • Mój RUB
  • FAQ
  • Polityka
  • Regulamin
  • DOI
  • Instrukcja
  • Aspekty prawne
  • Open Access
  • Archiwum


  • Kontakt
  • O Dspace
  • Strona Biblioteki
  • Strona Uczelni



    • Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3682
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorOkazaki, Hiroyuki-
    dc.contributor.authorFuta, Yuichi-
    dc.contributor.authorShidama, Yasunari-
    dc.date.accessioned2015-12-09T20:39:35Z-
    dc.date.available2015-12-09T20:39:35Z-
    dc.date.issued2013-
    dc.identifier.citationFormalized Mathematics, Volume 21, Issue 2, 2013, Pages 133-143-
    dc.identifier.issn1426-2630-
    dc.identifier.issn1898-9934-
    dc.identifier.urihttp://hdl.handle.net/11320/3682-
    dc.descriptionThis research was presented during the 2013 International Conference on Foundations of Computer Science FCS’13 in Las Vegas, USA.-
    dc.description.abstractHuffman 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.sponsorshipHiroyuki Okazaki - This work was supported by JSPS KAKENHI 21240001.-
    dc.description.sponsorshipYasunari Shidama - This work was supported by JSPS KAKENHI 22300285.-
    dc.language.isoen-
    dc.publisherDe Gruyter Open-
    dc.subjectformalization of Huffman coding tree-
    dc.subjectsource coding-
    dc.titleConstructing Binary Huffman Tree-
    dc.typeArticle-
    dc.identifier.doi10.2478/forma-2013-0015-
    dc.description.AffiliationOkazaki Hiroyuki - Shinshu University Nagano, Japan-
    dc.description.AffiliationFuta Yuichi - Japan Advanced Institute of Science and Technology Ishikawa, Japan-
    dc.description.AffiliationShidama Yasunari - Shinshu University Nagano, Japan-
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
    dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.-
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
    dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990.-
    dc.description.referencesGrzegorz Bancerek. König’s lemma. Formalized Mathematics, 2(3):397-402, 1991.-
    dc.description.referencesGrzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195-204, 1992.-
    dc.description.referencesGrzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.-
    dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.-
    dc.description.referencesGrzegorz Bancerek and Piotr Rudnicki. On defining functions on binary trees. Formalized Mathematics, 5(1):9-13, 1996.-
    dc.description.referencesCzesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.-
    dc.description.referencesCzesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.-
    dc.description.referencesCzesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
    dc.description.referencesCzesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
    dc.description.referencesKrzysztof Hryniewiecki. Recursive definitions. Formalized Mathematics, 1(2):321-328, 1990.-
    dc.description.referencesD. A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E, 1952.-
    dc.description.referencesAndrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990.-
    dc.description.referencesAndrzej Nedzusiak. σ-fields and probability. Formalized Mathematics, 1(2):401-407, 1990.-
    dc.description.referencesHiroyuki 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.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115-122, 1990.-
    dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990.-
    dc.description.referencesAndrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341-347, 2003.-
    dc.description.referencesMichał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.-
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.-
    dc.description.referencesEdmund 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 RozmiarFormat 
    forma-2013-0015.pdf254,61 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


    Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons