Dense non-binary Fibonacci codes

DOI10.1007/s00236-024-00473-9MaRDI QIDQ6660001

Shmuel T. Klein, Dana Shapira

Publication date: 10 January 2025

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is Huffmann coding dead?
• Robust universal complete codes for transmission and compression
• Integrated encryption in dynamic arithmetic compression
• High Sum-Rate Three-Write and Nonbinary WOM Codes
• Robust transmission of unbounded strings using Fibonacci representations
• Generalized 'write-once' memories
• Universal codeword sets and representations of the integers
• A method for obtaining digital signatures and public-key cryptosystems
• Economical encoding of commas between strings
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• A Method for the Construction of Minimum-Redundancy Codes
• Enhanced ternary Fibonacci codes

This page was built for publication: Dense non-binary Fibonacci codes