I was prompted by Chris Birke to take a look at this very interesting paper by Linus Lindroos. Chris is working with my E8 to H4 Folding Matrix for optimizing computation using network theory and hyper-dimensional geometric structures.

I was able to validate the paper with some quick Mathematica code.

Below is the code that sets up the generation of the tables, including various binary, numeric, and symbolic (graph) Compositions.

Notice the last statement (above) lists the odd FibBinaries (up to N=200) as related to the Floor of the n*Phi^2-1, with n=1 to 77.

Below is a listing of the first 100 N integers represented by their odd and even FibBinaries, along with the binary and Gray code Compositions.