Fibonacci coding encodes an integer into binary number using Fibonacci Representation of the number. The idea is based on Zeckendorf’s Theorem which states that every positive integer can be written uniquely as a sum of distinct non-neighbouring Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, ……..).

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. The extra 1 is appended to indicate end of code (Note that the code never contain two consecutive 1s as per Zeckendorf’s Theorem. The representation uses Fibonacci numbers starting from 1 (2’nd Fibonacci Number). So the Fibonacci Numbers used are 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, …….

**Given a number n, print its Fibonacci code.**

Examples:

Input: n = 1 Output: 11 1 is first Fibonacci number in this representation and an extra 1 is appended at the end. Input: n = 11 Output: 001011 11 is sum of 8 and 3. The last 1 represents extra 1 that is always added. A 1 before it represents 8. The third 1 (from beginning) represents 3.

**We strongly recommend you to minimize your browser and try this yourself first.**

The following algorithm takes an integer as input and generates a string that stores Fibonacci Encoding.

Find the largest Fibonacci number f less than or equal to n. Say it is the i’th number in the Fibonacci series. The length of codeword for n will be i+3 characters (One for extra 1 appended at the end, One because i is an index, and one for ‘\0’). Assuming that the Fibonacci series is stored:

- Let f be the largest Fibonacci less than or equal to n, prepend ‘1’ in the binary string. This indicates usage of f in representation for n. Subtract f from n: n = n – f
- Else if f is greater than n, prepend ‘0’ to the binary string.
- Move to the Fibonacci number just smaller than f .
- Repeat until zero remainder (n = 0)
- Append an additional ‘1’ to the binary string. We obtain an encoding such that two consecutive 1s indicate the end of a number (and the start of the next).

Below is C implementation of above algorithm.

`/* C program for Fibonacci Encoding of a positive integer n */` ` ` `#include<stdio.h> ` `#include<stdlib.h> ` ` ` `// To limit on the largest Fibonacci number to be used ` `#define N 30 ` ` ` `/* Array to store fibonacci numbers. fib[i] is going ` ` ` `to store (i+2)'th Fibonacci number*/` `int` `fib[N]; ` ` ` `// Stores values in fib and returns index of the largest ` `// fibonacci number smaller than n. ` `int` `largestFiboLessOrEqual(` `int` `n) ` `{ ` ` ` `fib[0] = 1; ` `// Fib[0] stores 2nd Fibonacci No. ` ` ` `fib[1] = 2; ` `// Fib[1] stores 3rd Fibonacci No. ` ` ` ` ` `// Keep Generating remaining numbers while previously ` ` ` `// generated number is smaller ` ` ` `int` `i; ` ` ` `for` `(i=2; fib[i-1]<=n; i++) ` ` ` `fib[i] = fib[i-1] + fib[i-2]; ` ` ` ` ` `// Return index of the largest fibonacci number ` ` ` `// smaller than or equal to n. Note that the above ` ` ` `// loop stopped when fib[i-1] became larger. ` ` ` `return` `(i-2); ` `} ` ` ` `/* Returns pointer to the char string which corresponds to ` ` ` `code for n */` `char` `* fibonacciEncoding(` `int` `n) ` `{ ` ` ` `int` `index = largestFiboLessOrEqual(n); ` ` ` ` ` `//allocate memory for codeword ` ` ` `char` `*codeword = (` `char` `*)` `malloc` `(` `sizeof` `(` `char` `)*(index+3)); ` ` ` ` ` `// index of the largest Fibonacci f <= n ` ` ` `int` `i = index; ` ` ` ` ` `while` `(n) ` ` ` `{ ` ` ` `// Mark usage of Fibonacci f (1 bit) ` ` ` `codeword[i] = ` `'1'` `; ` ` ` ` ` `// Subtract f from n ` ` ` `n = n - fib[i]; ` ` ` ` ` `// Move to Fibonacci just smaller than f ` ` ` `i = i - 1; ` ` ` ` ` `// Mark all Fibonacci > n as not used (0 bit), ` ` ` `// progress backwards ` ` ` `while` `(i>=0 && fib[i]>n) ` ` ` `{ ` ` ` `codeword[i] = ` `'0'` `; ` ` ` `i = i - 1; ` ` ` `} ` ` ` `} ` ` ` ` ` `//additional '1' bit ` ` ` `codeword[index+1] = ` `'1'` `; ` ` ` `codeword[index+2] = ` `'\0'` `; ` ` ` ` ` `//return pointer to codeword ` ` ` `return` `codeword; ` `} ` ` ` `/* driver function */` `int` `main() ` `{ ` ` ` `int` `n = 143; ` ` ` `printf` `(` `"Fibonacci code word for %d is %s\n"` `, n, fibonacciEncoding(n)); ` ` ` `return` `0; ` `}` |

Output:

Fibonacci code word for 143 is 01010101011

**Field of application:**

Data Processing & Compression – representing the data (which can be text, image, video…) in such a way that the space needed to store or transmit data is less than the size of input data. Statistical methods use variable-length codes, with the shorter codes assigned to symbols or group of symbols that have a higher probability of occurrence. If the codes are to be used over a noisy communication channel, their resilience to bit insertions, deletions and to bit-flips is of high importance.

Read more about the application here.

This article is contributed by **Yash Varyani**. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- What coding habits improve timing in coding contest?
- Check if a M-th fibonacci number divides N-th fibonacci number
- Secure coding - What is it all about?
- PHP | Coding Standards
- BFS using STL for competitive coding
- Oyo Coding Interview Experience
- SAP Placement Coding Questions
- Must Do Coding Questions Company-wise
- Digital Electronics | Block Coding
- Coding Mart Interview Experience
- TCS National Qualifier 2 Coding Question.
- Why is python best suited for Competitive Coding?
- Practice for cracking any coding interview
- How to attempt Function Coding Questions?
- PEP 8 : Coding Style guide in Python