On the decoding of 1-Fibonacci error correcting codes

DOI10.1142/S1793830921500567MaRDI QIDQ5025126zbMATH OpenFDO

Authors Emanuele Bellini, Chiara Marcolla, Nadir Murru

Publication date 1 February 2022

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

Full work available at URL https://arxiv.org/abs/2003.12991

zbMATH Keywords

Diophantine equationserror correcting codesFibonacci numbersgolden ratiorecurrent sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Decoding (94B35) Arithmetic codes (94B40) Other types of codes (94B60)

Abstract: The study of new error correcting codes has raised attention in the last years, especially because of their use in cryptosystems that are resistant to attacks running on quantum computers. In 2006, while leaving a more in-depth analysis for future research, Stakhov gave some interesting ideas on how to exploit Fibonacci numbers to derive an original error correcting code with a compact representation. In this work we provide an explicit formula to compute the redundancy of Stakhov codes, we identify some flows in the initial decoding procedure described by Stakhov, whose crucial point is to solve some non-trivial Diophantine equations, and provide a detailed discussion on how to avoid solving such equations in some cases and on how to detect and correct errors more efficiently.

Recommendations

• A Fibonacci-polynomial based coding method with error detection and correction
• Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
• A new class of Fibonacci sequence based error correcting codes
• Coding theory on Fibonacci n-step numbers
• A new coding/decoding algorithm using Fibonacci numbers

Cites work

• A Fibonacci-polynomial based coding method with error detection and correction
• A new class of Fibonacci sequence based error correcting codes
• A new coding/decoding algorithm using Fibonacci numbers
• Coding theory on Lucas \(p\) numbers
• Coding theory on the (m,t)-extension of the Fibonacci p-numbers
• Coding theory on the \(m\)-extension of the Fibonacci \(p\)-numbers
• Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
• High rates of Fibonacci polynomials coding theory
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• The generalized relations among the code elements for Fibonacci coding theory
• The mathematics of harmony. From Euclid to contemporary mathematics and computer science. Assisted by Scott Olsen

Cited in

(1)

• Long range variations on the Fibonacci universal code

This page was built for publication: On the decoding of 1-Fibonacci error correcting codes

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