ملخص
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 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - مارس 2025 |