Enhanced Ternary Fibonacci Codes

Shmuel T. Klein, Dana Shapira

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

1 Scopus citations

Abstract

Extending previous work on non-binary Fibonacci codes, a new ternary variant is proposed sharing the main features like robustness against errors and ease of encoding and decoding, while improving the compression efficiency relative to other ternary codes. The improvement is based on an increased density of the codes and also shown empirically on large textual examples. A motivation for d-ary codes, with d> 2, may be the emergence of future technologies that enable the representation of more than just two values in an atomic storage unit.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 27th International Conference, CIAA 2023, Proceedings
EditorsBenedek Nagy, Benedek Nagy
PublisherSpringer Science and Business Media Deutschland GmbH
Pages179-193
Number of pages15
ISBN (Print)9783031402463
DOIs
StatePublished - 2023
EventImplementation and Application of Automata - 27th International Conference, CIAA 2023, Proceedings - Famagusta, Cyprus
Duration: 19 Sep 202322 Sep 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14151 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceImplementation and Application of Automata - 27th International Conference, CIAA 2023, Proceedings
Country/TerritoryCyprus
CityFamagusta
Period19/09/2322/09/23

Keywords

  • Data compression
  • Fibonacci codes
  • Huffman Coding

Fingerprint

Dive into the research topics of 'Enhanced Ternary Fibonacci Codes'. Together they form a unique fingerprint.

Cite this