תקציר
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.
שפה מקורית | אנגלית |
---|---|
מספר המאמר | 8 |
כתב עת | Acta Informatica |
כרך | 62 |
מספר גיליון | 1 |
מזהי עצם דיגיטלי (DOIs) | |
סטטוס פרסום | פורסם - מרץ 2025 |