密集非二进制斐波那契码

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2024-12-18 DOI:10.1007/s00236-024-00473-9

Shmuel T. Klein, Dana Shapira

{"title":"密集非二进制斐波那契码","authors":"Shmuel T. Klein, Dana Shapira","doi":"10.1007/s00236-024-00473-9","DOIUrl":null,"url":null,"abstract":"<div><p>The current study advances prior research on non-binary Fibonacci codes by introducing new families of universal codes. These codes demonstrate the advantage of accommodating a larger number of codewords for sufficiently large lengths. They retain the properties of instantaneous decipherability and robustness against transmission errors. This work presents these dense codes as a promising alternative for compressing extensive lists of very large integers, commonly encountered in cryptographic applications. \n</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"62 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dense non-binary Fibonacci codes\",\"authors\":\"Shmuel T. Klein, Dana Shapira\",\"doi\":\"10.1007/s00236-024-00473-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The current study advances prior research on non-binary Fibonacci codes by introducing new families of universal codes. These codes demonstrate the advantage of accommodating a larger number of codewords for sufficiently large lengths. They retain the properties of instantaneous decipherability and robustness against transmission errors. This work presents these dense codes as a promising alternative for compressing extensive lists of very large integers, commonly encountered in cryptographic applications. \\n</p></div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":\"62 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-024-00473-9\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-024-00473-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

目前的研究通过引入新的通用码族来推进非二进制斐波那契码的先前研究。这些代码展示了在足够大的长度下容纳大量码字的优点。它们保留了瞬时可译性和对传输错误的鲁棒性。这项工作将这些密集代码作为一种有希望的替代方案，用于压缩在密码学应用程序中经常遇到的非常大的整数的广泛列表。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Dense non-binary Fibonacci codes

查看原文本刊更多论文

Dense non-binary Fibonacci codes

The current study advances prior research on non-binary Fibonacci codes by introducing new families of universal codes. These codes demonstrate the advantage of accommodating a larger number of codewords for sufficiently large lengths. They retain the properties of instantaneous decipherability and robustness against transmission errors. This work presents these dense codes as a promising alternative for compressing extensive lists of very large integers, commonly encountered in cryptographic applications.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.