Pell coding and pell decoding methods with some applications
From MaRDI portal
Publication:3303516
DOI10.11575/cdm.v15i1.62606zbMath1442.14092arXiv1706.04377OpenAlexW3118723405MaRDI QIDQ3303516
Sümeyra Uçar, Nihal Taş, Nihal Yilmaz Özgür
Publication date: 12 August 2020
Full work available at URL: https://arxiv.org/abs/1706.04377
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications to coding theory and cryptography of arithmetic geometry (14G50) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Cites Work
- The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
- The generalized relations among the code elements for Fibonacci coding theory
- 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 coding/decoding algorithm using Fibonacci numbers
- Coding theory on Lucas p numbers
- Pell and Pell–Lucas Numbers with Applications