Abstract
We propose a family of Fibonacci-style codes, combining the advantages of higher-order Fibonacci numeration systems and the flexibility of binary mixed-digit codes. We establish the theoretical foundation of these new codes, proving a generalization of the Kraft inequality for prefix-free codes on mixed-digit numeration systems and the completeness of the new family of Fibonacci codes. Experiments on natural language text show that the proposed codes provide a coding structure that can adapt to various data distributions and capable of achieving superior compression ratios.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - DCC 2025 |
| Subtitle of host publication | 2025 Data Compression Conference |
| Editors | Ali Bilgin, James E. Fowler, Joan Serra-Sagrista, Yan Ye, James A. Storer |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 193-202 |
| Number of pages | 10 |
| ISBN (Electronic) | 9798331534714 |
| DOIs | |
| State | Published - 2025 |
| Event | 2025 Data Compression Conference, DCC 2025 - Snowbird, United States Duration: 18 Mar 2025 → 21 Mar 2025 |
Publication series
| Name | Data Compression Conference Proceedings |
|---|---|
| ISSN (Print) | 1068-0314 |
Conference
| Conference | 2025 Data Compression Conference, DCC 2025 |
|---|---|
| Country/Territory | United States |
| City | Snowbird |
| Period | 18/03/25 → 21/03/25 |
Bibliographical note
Publisher Copyright:© 2025 IEEE.
Keywords
- complete code
- fibonacci codes
- kraft inequality