Flag Encodings Related to the Zeckendorf Representation of Integers

Renato M. Capocelli
Additional contact information
Renato M. Capocelli: Università di Salerno, Dipartimento di Informatica ed Applicazioni

A chapter in Sequences, 1990, pp 449-466 from Springer

Abstract: Abstract The Zeckendorf’s representation has the property that it contains no sequence of r or more consecutive ones. This property can be used for separating codewords providing efficient flag encodings that are almost optimal and free from error propagation.

Keywords: Encode Scheme; Binary String; Binary Representation; Fibonacci Number; Tree Code (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_36

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_36

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().