A New Coding Theory on Fibonacci n-Step Polynomials

Journal Home
Volume 19 - 2024
- Vol. 19, Issue 2 pp.81-190
- Vol. 19, Issue 1 pp.1-80
Volume 18 - 2023
- Vol. 18, Issue 2 pp.81-160
- Vol. 18, Issue 1 pp.1-80
Volume 17 - 2022
- Vol. 17, Issue 2 pp.83-160
- Vol. 17, Issue 1 pp.1-80
Volume 16 - 2021
- Vol. 16, Issue 2 pp.83-159
- Vol. 16, Issue 1 pp.1-80
Volume 15 - 2020
- Vol. 15, Issue 2 pp.83-160
- Vol. 15, Issue 1 pp.1-73
Volume 14 - 2019
- Vol. 14, Issue 4 pp.243-320
- Vol. 14, Issue 3 pp.163-240
- Vol. 14, Issue 2 pp.83-160
- Vol. 14, Issue 1 pp.1-80
Volume 13 - 2018
- Vol. 13, Issue 4 pp.243-320
- Vol. 13, Issue 3 pp.163-240
- Vol. 13, Issue 2 pp.83-160
- Vol. 13, Issue 1 pp.1-80
Volume 12 - 2017
- Vol. 12, Issue 4 pp.243-320
- Vol. 12, Issue 3 pp.163-240
- Vol. 12, Issue 2 pp.83-160
- Vol. 12, Issue 1 pp.1-80
Volume 11 - 2016
- Vol. 11, Issue 4 pp.243-320
- Vol. 11, Issue 3 pp.163-240
- Vol. 11, Issue 2 pp.83-160
- Vol. 11, Issue 1 pp.1-80
Volume 10 - 2015
- Vol. 10, Issue 4 pp.243-320
- Vol. 10, Issue 3 pp.163-240
- Vol. 10, Issue 2 pp.83-160
- Vol. 10, Issue 1 pp.1-80
Volume 9 - 2014
- Vol. 9, Issue 4 pp.243-320
- Vol. 9, Issue 3 pp.163-240
- Vol. 9, Issue 2 pp.83-153
- Vol. 9, Issue 1 pp.1-80
Volume 8 - 2013
- Vol. 8, Issue 4 pp.243-320
- Vol. 8, Issue 3 pp.163-240
- Vol. 8, Issue 2 pp.83-160
- Vol. 8, Issue 1 pp.1-80
Volume 7 - 2012
- Vol. 7, Issue 4 pp.243-320
- Vol. 7, Issue 3 pp.163-240
- Vol. 7, Issue 2 pp.83-160
- Vol. 7, Issue 1 pp.1-80
Volume 6 - 2011
- Vol. 6, Issue 4 pp.243-320
- Vol. 6, Issue 3 pp.163-240
- Vol. 6, Issue 2 pp.83-160
- Vol. 6, Issue 1 pp.1-80
Volume 5 - 2010
- Vol. 5, Issue 4 pp.243-320
- Vol. 5, Issue 3 pp.163-240
- Vol. 5, Issue 2 pp.83-160
- Vol. 5, Issue 1 pp.1-80
Volume 4 - 2009
- Vol. 4, Issue 4 pp.243-320
- Vol. 4, Issue 3 pp.161-239
- Vol. 4, Issue 2 pp.83-160
- Vol. 4, Issue 1 pp.1-80
Volume 3 - 2008
- Vol. 3, Issue 4 pp.243-268
- Vol. 3, Issue 3 pp.163-224
- Vol. 3, Issue 2 pp.83-152
- Vol. 3, Issue 1 pp.1-72
Volume 2 - 2007
- Vol. 2, Issue 4 pp.243-298
- Vol. 2, Issue 3 pp.163-240
- Vol. 2, Issue 2 pp.85-160
- Vol. 2, Issue 1 pp.1-80
Volume 1 - 2006
- Vol. 1, Issue 5 pp.259-317
- Vol. 1, Issue 4 pp.195-256
- Vol. 1, Issue 3 pp.129-192
- Vol. 1, Issue 2 pp.65-128
- Vol. 1, Issue 1 pp.1-64

Volume 13, Issue 1

Monojit Das and Manjusri Basu

J. Info. Comput. Sci. , 13 (2018), pp. 056-073.

[An open-access article; the PDF is free to any online user.]

Preview Full PDF 380 2801

Cited by

google scholar semantic scholar

Export citation

Abstract

In this paper, we develop a new series of Fibonacci ?-step polynomials. Based on these series of polynomials, we introduce a new class of square matrix of order ?. Thereby, we define a new coding theory called Fibonacci ?-step polynomials coding theory. Then we calculate the generalized relations among the code elements for all values of ?. It is shown that, for ? = 2, the correct ability of this method is 93.33% whereas for n = 3, the correct ability of this method is 99.80%. The interesting part of this coding/decoding method is that the correct ability does not depend on ? and increases as ? increases.

Keywords

AMS Subject Headings

Email address

BibTex
RIS
TXT

@Article{JICS-13-056, author = {Monojit Das and Manjusri Basu}, title = {A New Coding Theory on Fibonacci n-Step Polynomials}, journal = {Journal of Information and Computing Science}, year = {2018}, volume = {13}, number = {1}, pages = {056--073}, abstract = {In this paper, we develop a new series of Fibonacci ?-step polynomials. Based on these series of polynomials, we introduce a new class of square matrix of order ?. Thereby, we define a new coding theory called Fibonacci ?-step polynomials coding theory. Then we calculate the generalized relations among the code elements for all values of ?. It is shown that, for ? = 2, the correct ability of this method is 93.33% whereas for n = 3, the correct ability of this method is 99.80%. The interesting part of this coding/decoding method is that the correct ability does not depend on ? and increases as ? increases. }, issn = {3080-180X}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22464.html} }

TY - JOUR T1 - A New Coding Theory on Fibonacci n-Step Polynomials AU - Monojit Das and Manjusri Basu JO - Journal of Information and Computing Science VL - 1 SP - 056 EP - 073 PY - 2018 DA - 2018/03 SN - 13 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22464.html KW - AB - In this paper, we develop a new series of Fibonacci ?-step polynomials. Based on these series of polynomials, we introduce a new class of square matrix of order ?. Thereby, we define a new coding theory called Fibonacci ?-step polynomials coding theory. Then we calculate the generalized relations among the code elements for all values of ?. It is shown that, for ? = 2, the correct ability of this method is 93.33% whereas for n = 3, the correct ability of this method is 99.80%. The interesting part of this coding/decoding method is that the correct ability does not depend on ? and increases as ? increases.

Monojit Das and Manjusri Basu. (2018). A New Coding Theory on Fibonacci n-Step Polynomials. Journal of Information and Computing Science. 13 (1). 056-073. doi:

Copy to clipboard

BibteX RIS TXT

The citation has been copied to your clipboard

- LOGIN -

- E-mail verification -

- REGISTER -