Enhanced ternary Fibonacci codes

DOI10.1007/978-3-031-40247-0_13OpenAlexW4385701281MaRDI QIDQ6199873FDOQ6199873

Authors: Shmuel T. Klein, Dana Shapira 

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_13

zbMATH Keywords

data compressionHuffman codingFibonacci codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A Method for the Construction of Minimum-Redundancy Codes
• Robust universal complete codes for transmission and compression
• Universal codeword sets and representations of the integers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Economical encoding of commas between strings
• Computing in Russia. The history of computer devices and information technology revealed. Transl. from the Russian by Alexander Y. Nitussov
• Title not available (Why is that?)

Cited In (1)

• Dense non-binary Fibonacci codes

This page was built for publication: Enhanced ternary Fibonacci codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199873)