Pell coding and Pell decoding methods with some applications
From MaRDI portal
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Abstract: We obtain a new coding and decoding method using the generalized Pell -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking algorithms using Pell numbers and generalized Pell -numbers.
Recommendations
Cites work
- A Fibonacci-polynomial based coding method with error detection and correction
- A new coding/decoding algorithm using Fibonacci numbers
- Coding theory on Lucas \(p\) numbers
- Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
- Pell and Pell-Lucas numbers with applications
- The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
- The generalized relations among the code elements for Fibonacci coding theory
Cited in
(3)
This page was built for publication: Pell coding and Pell decoding methods with some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303516)