CODING THEORY ON FIBONACCI n-STEP NUMBERS

DOI10.1142/S1793830914500177zbMath1325.11020OpenAlexW2088532517WikidataQ114071651 ScholiaQ114071651MaRDI QIDQ2875682

Monojit Das, Manjusri Basu

Publication date: 11 August 2014

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

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

zbMATH Keywords

Fibonacci numberserror correction\(n\)-anacci constantFibonacci \(n\)-step codingFibonacci \(n\)-step matricesFibonacci \(n\)-step numbers

Mathematics Subject Classification ID

Information theory (general) (94A15) Matrices of integers (15B36) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (5)

Combinatorial properties of Fibonacci partial words and arrays ⋮ k-order Gaussian Fibonacci polynomials and applications to the coding/decoding theory ⋮ Companion matrices and golden-Fibonacci sequences ⋮ The Moore-Penrose inverse of the rectangular Fibonacci matrix and applications to the cryptology ⋮ Unnamed Item

This page was built for publication: CODING THEORY ON FIBONACCI n-STEP NUMBERS