{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T03:18:27Z","timestamp":1772853507097,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439797","type":"print"},{"value":"9783031439803","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_31","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"381-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Binary Mixed-Digit Data Compression Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4826-5265","authenticated-orcid":false,"given":"Igor","family":"Zavadskyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8450-905X","authenticated-orcid":false,"given":"Maksym","family":"Kovalchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Duda, J., Tahboub, K., Gadgil, N., Delp, E.: The use of asymmetric numeral systems as an accurate replacement for Huffman coding. 2015 Picture Coding Symposium (PCS), pp. 65\u201369 (2015)","DOI":"10.1109\/PCS.2015.7170048"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum-redundancy codes. Proc. IRE 40, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E Silva de Moura","year":"2000","unstructured":"Silva de Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst. 18(2), 113\u2013119 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-39984-1_10","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2003","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F.: (S,C)-dense coding: an optimized compression code for natural language text databases. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 122\u2013136. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39984-1_10"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11575832_1","volume-title":"String Processing and Information Retrieval","author":"JS Culpepper","year":"2005","unstructured":"Culpepper, J.S., Moffat, A.: Enhanced byte codes with restricted prefix properties. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575832_1"},{"key":"31_CR6","unstructured":"Giesen, F.: Entropy decoding in Oodle data: Huffman decoding on the jaguar. https:\/\/fgiesen.wordpress.com\/2022\/04\/04\/entropy-decoding-in-oodle-data-huffman-decoding-on-the-jaguar\/"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Zavadskyi, I.O.: Binary-coded ternary number representation in natural language text compression. In: 2022 Data Compression Conference, pp. 419\u2013428 (2022)","DOI":"10.1109\/DCC52660.2022.00050"},{"issue":"6","key":"31_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1093\/comjnl\/bxp046","volume":"53","author":"ST Klein","year":"2010","unstructured":"Klein, S.T., Ben-Nissan, M.: On the usefulness of Fibonacci compression codes. Comput. J. 53(6), 701\u2013716 (2010)","journal-title":"Comput. J."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Zavadskyi, I.O., Anisimov, A.V.: Reverse multi-delimiter compression codes. In: 2020 Data Compression Conference, pp. 173\u2013182 (2020)","DOI":"10.1109\/DCC47342.2020.00025"},{"key":"31_CR10","unstructured":"Anisimov, A., Zavadskyi, I., Chudakov, T.: Practical word-based text compression using the reverse multi-delimiter codes. In: Information Technology and Implementation (IT&I-2022), CEUR Workshop Proceedings, pp. 175\u2013183 (2022)"},{"key":"31_CR11","unstructured":"Zavadskyi, I., Kovalchuk, M.: The binary mixed digit codes in C programming language. https:\/\/github.com\/zavadsky\/BCMix"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:04:46Z","timestamp":1695125086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}