{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:16:09Z","timestamp":1743221769728,"version":"3.40.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-024-00473-9","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T16:13:23Z","timestamp":1734538403000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dense non-binary Fibonacci codes"],"prefix":"10.1007","volume":"62","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"issue":"5","key":"473_CR1","first-page":"2885","volume":"63","author":"AV Anisimov","year":"2017","unstructured":"Anisimov, A.V., Zavadskyi, I.O.: Variable-length prefix codes with multiple delimiters. IEEE Trans. Inf. Theory 63(5), 2885\u20132895 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"473_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","volume":"33","author":"A Apostolico","year":"1987","unstructured":"Apostolico, A., Fraenkel, A.S.: Robust transmission of unbounded strings using Fibonacci representations. IEEE Trans. Inf. Theory 33(2), 238\u2013245 (1987). https:\/\/doi.org\/10.1109\/TIT.1987.1057284","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"473_CR3","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1093\/comjnl\/bxaa169","volume":"65","author":"G Baruch","year":"2022","unstructured":"Baruch, G., Klein, S.T., Shapira, D.: Enhanced context sensitive flash codes. Comput. J. 65(5), 1200\u20131210 (2022)","journal-title":"Comput. J."},{"issue":"4","key":"473_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02243872","volume":"50","author":"A Bookstein","year":"1993","unstructured":"Bookstein, A., Klein, S.T.: Is Huffman coding dead? Computing 50(4), 279\u2013296 (1993)","journal-title":"Computing"},{"key":"473_CR5","doi-asserted-by":"crossref","unstructured":"Choueka, Y., Klein, S.T., Perl, Y.: Efficient variants of Huffman codes in high level languages. In Proceedings of the 8th annual international ACM SIGIR conference, Montr\u00e9al, Canada, June 5-7, pages 122\u2013130, 1985","DOI":"10.1145\/253495.342777"},{"issue":"2","key":"473_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"473_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/359460.359480","volume":"21","author":"S Even","year":"1978","unstructured":"Even, S., Rodeh, M.: Economical encoding of commas between strings. Commun. ACM 21(4), 315\u2013317 (1978)","journal-title":"Commun. ACM"},{"key":"473_CR8","first-page":"133","volume-title":"Handbook of empirical economics and finance","author":"S Fagan","year":"2010","unstructured":"Fagan, S., Gen\u00e7ay, R.: An introduction to textual econometrics. In: Ullah, A., Giles, D.E. (eds.) Handbook of empirical economics and finance, pp. 133\u2013153. CRC Press, Boca Raton (2010)"},{"issue":"3","key":"473_CR9","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/TIT.1984.1056918","volume":"30","author":"A Fiat","year":"1984","unstructured":"Fiat, A., Shamir, A.: Generalized write-once memories. IEEE Trans. Inf. Theory 30(3), 470\u2013479 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"473_CR10","doi-asserted-by":"crossref","unstructured":"Fraenkel, A.\u00a0S.: Systems of numeration. In 6th IEEE symposium on computer arithmetic, ARITH 1983, Aarhus, Denmark, June 20-22, 1983, pages 37\u201342, 1983","DOI":"10.1109\/ARITH.1983.6158079"},{"issue":"1","key":"473_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","volume":"64","author":"AS Fraenkel","year":"1996","unstructured":"Fraenkel, A.S., Klein, S.T.: Robust universal complete codes for transmission and compression. Discrete Appl. Math. 64(1), 31\u201355 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"473_CR12","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Technic. J. 38(4), 933\u2013967 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01583.x","journal-title":"Bell Syst. Technic. J."},{"issue":"9","key":"473_CR13","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"473_CR14","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1093\/comjnl\/bxp046","volume":"53","author":"ST Klein","year":"2010","unstructured":"Klein, S.T., Kopel Ben-Nissan, M.: On the usefulness of Fibonacci compression codes. Comput. J. 53, 701\u2013716 (2010)","journal-title":"Comput. J."},{"key":"473_CR15","doi-asserted-by":"publisher","first-page":"112043","DOI":"10.1109\/ACCESS.2022.3214820","volume":"10","author":"ST Klein","year":"2022","unstructured":"Klein, S.T., Serebro, T.C., Shapira, D.: Generalization of Fibonacci codes to the non-binary case. IEEE Access 10, 112043\u2013112052 (2022)","journal-title":"IEEE Access"},{"issue":"1","key":"473_CR16","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1093\/comjnl\/bxy020","volume":"62","author":"ST Klein","year":"2019","unstructured":"Klein, S.T., Shapira, D.: Context sensitive rewriting codes for flash memory. Comput. J. 62(1), 20\u201329 (2019)","journal-title":"Comput. J."},{"key":"473_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104617","volume":"279","author":"ST Klein","year":"2021","unstructured":"Klein, S.T., Shapira, D.: Integrated encryption in dynamic arithmetic compression. Inf. Comput. 279, 104617 (2021)","journal-title":"Inf. Comput."},{"key":"473_CR18","doi-asserted-by":"crossref","unstructured":"Klein, S.\u00a0T., Shapira, D.: Enhanced ternary Fibonacci codes. In: Proc CIAA\u201923 Conference, Famagusta, North Cyprus, volume 14151 of LNCS, pages 179\u2013193. Springer (2023)","DOI":"10.1007\/978-3-031-40247-0_13"},{"key":"473_CR19","doi-asserted-by":"crossref","unstructured":"Klein, S.\u00a0T., Shapira, D.: Denser high-order Fibonacci codes. In: Data Compression Conference, DCC 2024, Snowbird, UT, USA, March 20-22, 2024, pages 263\u2013272. IEEE (2024)","DOI":"10.1109\/DCC58796.2024.00034"},{"issue":"2","key":"473_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A Moffat","year":"1989","unstructured":"Moffat, A.: Word-based text compression. Softw. Pract. Exp. 19(2), 185\u2013198 (1989)","journal-title":"Softw. Pract. Exp."},{"key":"473_CR21","doi-asserted-by":"crossref","unstructured":"Moffat, A., Turpin, A.: Compression and coding algorithms, volume 669 of The international series in engineering and computer science. Kluwer (2002)","DOI":"10.1007\/978-1-4615-0935-6"},{"issue":"2","key":"473_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"6","key":"473_CR23","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"issue":"11","key":"473_CR24","doi-asserted-by":"publisher","first-page":"7006","DOI":"10.1109\/TIT.2014.2352213","volume":"60","author":"E Yaakobi","year":"2014","unstructured":"Yaakobi, E., Shpilka, A.: High sum-rate three-write and nonbinary WOM codes. IEEE Trans. Inf. Theory 60(11), 7006\u20137015 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"473_CR25","first-page":"179","volume":"41","author":"E Zeckendorf","year":"1972","unstructured":"Zeckendorf, E.: Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. R. Sci. Li\u00e8ge 41, 179\u2013182 (1972)","journal-title":"Bull. Soc. R. Sci. Li\u00e8ge"},{"key":"473_CR26","unstructured":"Zipf George, K.: Human behavior and the principle of least effort, Ravenio Books (1949)"},{"issue":"3","key":"473_CR27","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"473_CR28","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055934","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00473-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00473-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00473-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:24:00Z","timestamp":1743200640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00473-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["473"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00473-9","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"1 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"8"}}