{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:40Z","timestamp":1740169300124,"version":"3.37.3"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Slovensk\u00e1 sporite\u013e\u0148a, a.s","award":["0824\/2019\/\/CE"],"award-info":[{"award-number":["0824\/2019\/\/CE"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3222354","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T21:42:06Z","timestamp":1668462126000},"page":"125955-125962","source":"Crossref","is-referenced-by-count":0,"title":["A Note on the Maximum Size of a Prefix Code"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9767-7728","authenticated-orcid":false,"given":"Viliam","family":"Hromada","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Bratislava, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3701-3468","authenticated-orcid":false,"given":"Otokar","family":"Grosek","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Bratislava, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053782"},{"key":"ref11","first-page":"1","article-title":"DNA encryption algorithm based on Huffman coding","volume":"25","author":"meftah","year":"2020","journal-title":"J Discrete Math Sci Cryptogr"},{"journal-title":"An Introduction to Theory of Numbers","year":"1991","author":"niven","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1201\/9781351011419-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography1030021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11434-006-2012-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/s21186236"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref3"},{"key":"ref6","first-page":"1","article-title":"On the maximum size of a prefix code","volume":"19866205","author":"hor\u00e1k","year":"2022","journal-title":"TechRxiv"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/77556.77566"},{"journal-title":"The Codebreakers","year":"1967","author":"kahn","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10212647"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033265"},{"journal-title":"Codes Secrets of the New Cryptology","year":"1984","author":"kahn","key":"ref9"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09950472.pdf?arnumber=9950472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:38:08Z","timestamp":1672083488000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9950472\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3222354","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}