High rates of Fibonacci polynomials coding theory

DOI10.1142/S1793830914500530zbMath1371.94691OpenAlexW1964903255MaRDI QIDQ2931916

Bandhu Prasad

Publication date: 28 November 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500530

zbMATH Keywords

golden meanFibonacci \(p\)-numberscode rate

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

On the decoding of 1-Fibonacci error correcting codes

Cites Work

• On the \(m\)-extension of the Fibonacci and Lucas \(p\)-numbers
• The generalized relations among the code elements for Fibonacci coding theory
• On generalized Fibonacci and Lucas polynomials
• A Fibonacci-polynomial based coding method with error detection and correction
• On \(k\)-Fibonacci sequences and polynomials and their derivatives
• Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory

This page was built for publication: High rates of Fibonacci polynomials coding theory