{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:37:49Z","timestamp":1648924669808},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n\t\t\t\t<jats:p>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.<\/jats:p>","DOI":"10.2478\/forma-2013-0015","type":"journal-article","created":{"date-parts":[[2014,1,9]],"date-time":"2014-01-09T20:14:15Z","timestamp":1389298455000},"page":"133-143","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Binary Huffman Tree"],"prefix":"10.2478","volume":"21","author":[{"given":"Hiroyuki","family":"Okazaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Futa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasunari","family":"Shidama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","container-title":["Formalized Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/forma\/21\/2\/article-p133.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/forma.2013.21.issue-2\/forma-2013-0015\/forma-2013-0015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T16:17:30Z","timestamp":1590769050000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/forma-2013-0015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,1]]},"references-count":0,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/forma-2013-0015","relation":{},"ISSN":["1898-9934","1426-2630"],"issn-type":[{"value":"1898-9934","type":"electronic"},{"value":"1426-2630","type":"print"}],"subject":[],"published":{"date-parts":[[2013,6,1]]}}}