Abstract
Previous work on non-binary Fibonacci codes is extended by the presentation of a new family of universal codes having the additional advantage of admitting more codewords for a given large enough length. These denser codes also share the other properties of instantaneous decipherability and robustness against transmission errors, and are proposed as an alternative to compress lists of very large integers, like those used in cryptography.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - DCC 2024 |
| Subtitle of host publication | 2024 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 | 263-272 |
| Number of pages | 10 |
| ISBN (Electronic) | 9798350385878 |
| DOIs | |
| State | Published - 2024 |
| Event | 2024 Data Compression Conference, DCC 2024 - Snowbird, United States Duration: 19 Mar 2024 → 22 Mar 2024 |
Publication series
| Name | Data Compression Conference Proceedings |
|---|---|
| ISSN (Print) | 1068-0314 |
Conference
| Conference | 2024 Data Compression Conference, DCC 2024 |
|---|---|
| Country/Territory | United States |
| City | Snowbird |
| Period | 19/03/24 → 22/03/24 |
Bibliographical note
Publisher Copyright:© 2024 IEEE.
Keywords
- Fibonacci codes
- non-binary codes
- universal codes