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. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.