Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Fibonacci coding
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Universal code which encodes positive integers into binary code words}} {{more footnotes|date=January 2013}} {{numeral systems}} In [[mathematics]] and computing, '''Fibonacci coding''' is a [[universal code (data compression)|universal code]]{{citation needed|date=October 2015}} which encodes positive integers into binary [[Code word (communication)|code word]]s. It is one example of representations of integers based on [[Fibonacci number]]s. Each code word ends with "11" and contains no other instances of "11" before the end. The Fibonacci code is closely related to the [[Zeckendorf representation]], a positional [[numeral system]] that uses [[Zeckendorf's theorem]] and has the property that no number has a representation with consecutive 1s. The Fibonacci code word for a particular integer is exactly the integer's Zeckendorf representation with the order of its digits reversed and an additional "1" appended to the end.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)