Denser High-Order Fibonacci Codes

Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationProceedings - DCC 2024
Subtitle of host publication2024 Data Compression Conference
EditorsAli Bilgin, James E. Fowler, Joan Serra-Sagrista, Yan Ye, James A. Storer
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)9798350385878
StatePublished - 2024
Event2024 Data Compression Conference, DCC 2024 - Snowbird, United States
Duration: 19 Mar 202422 Mar 2024

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Conference2024 Data Compression Conference, DCC 2024
Country/TerritoryUnited States


  • Fibonacci codes
  • non-binary codes
  • universal codes


Dive into the research topics of 'Denser High-Order Fibonacci Codes'. Together they form a unique fingerprint.

Cite this