Robust transmission of unbounded strings using Fibonacci representations

DOI10.1109/TIT.1987.1057284zbMath0626.94007MaRDI QIDQ3030717

Aviezri S. Fraenkel, Alberto Apostolico

Publication date: 1987

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

robustnessFibonacci codesFibonacci representationstransmission of binary strings

Mathematics Subject Classification ID

Information theory (general) (94A15) Prefix, length-variable, comma-free codes (94A45)

Related Items (17)

Random access to Fibonacci encoded files ⋮ The myriad virtues of wavelet trees ⋮ The use and usefulness of numeration systems ⋮ Robust universal complete codes for transmission and compression ⋮ Fast decoding algorithms for variable-lengths codes ⋮ Generating \((2,3)\)-codes ⋮ Two-base numeration systems ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ The third order variations on the Fibonacci universal code ⋮ Should one always use repeated squaring for modular exponentiation? ⋮ Long range variations on the Fibonacci universal code ⋮ Natural-Language Text Compression Using Reverse Multi-Delimiter Codes ⋮ Lossless text compression by means of binary-coded ternary number representation ⋮ On the complexity of Fibonacci coding ⋮ Integer representation in the mixed base \((2,3)\) ⋮ Bridging Lossy and Lossless Compression by Motif Pattern Discovery ⋮ New compression schemes for natural number sequences

This page was built for publication: Robust transmission of unbounded strings using Fibonacci representations