Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers

DOI10.1109/TIT.2017.2663433MaRDI QIDQ5280900zbMATH OpenOpenAlexWikidataFDO

Authors Bruno T. Ávila, Ricardo M. Campello de Souza

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/tit.2017.2663433

Mathematics Subject Classification ID

Source coding (94A29) Combinatorial codes (94B25)

Recommendations

• Meta-Fibonacci sequences, binary trees and extremal compact codes
• Universal codes of the natural numbers
• Coding theory on Fibonacci n-step numbers
• Coding theory on the \(m\)-extension of the Fibonacci \(p\)-numbers
• On the complexity of Fibonacci coding
• A new recursive universal code of the positive integers
• Coding theory on the (m,t)-extension of the Fibonacci p-numbers
• A new coding/decoding algorithm using Fibonacci numbers
• High rates of Fibonacci polynomials coding theory
• Coding theory on h(x) extension of m sequences for Fibonacci numbers

Cited in

(2)

• Robust transmission of unbounded strings using Fibonacci representations
• A new recursive universal code of the positive integers

This page was built for publication: Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280900)