{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T22:51:52Z","timestamp":1767567112459,"version":"3.40.4"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>We consider the series of Fibonacci n-step numbers and a class of square matrix of order n based on Fibonacci n-step numbers with determinant +1 or -1. Thereby, we introduce a new coding theory called Fibonacci n-step coding theory and establish generalized relation among the code elements for all values of n. For n = 2, the correct ability of the method is 93.33%; for n = 3, the correct ability of the method is 99.80% and for n = 4, the correct ability of the method is 99.998%. In general, the correct ability of the method increases as n increases.<\/jats:p>","DOI":"10.1142\/s1793830914500177","type":"journal-article","created":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T03:38:38Z","timestamp":1389929918000},"page":"1450017","source":"Crossref","is-referenced-by-count":7,"title":["CODING THEORY ON FIBONACCI n-STEP NUMBERS"],"prefix":"10.1142","volume":"06","author":[{"given":"MANJUSRI","family":"BASU","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani 741235, West Bengal, India"}]},{"given":"MONOJIT","family":"DAS","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani 741235, West Bengal, India"}]}],"member":"219","published-online":{"date-parts":[[2014,3,19]]},"reference":[{"volume":"6","author":"Basu M.","journal-title":"Discrete Math. Algorithms Appl.","key":"rf1"},{"doi-asserted-by":"publisher","key":"rf2","DOI":"10.1016\/0898-1221(95)00062-4"},{"doi-asserted-by":"publisher","key":"rf3","DOI":"10.1016\/S0960-0779(03)00278-9"},{"doi-asserted-by":"publisher","key":"rf4","DOI":"10.1016\/j.chaos.2006.04.043"},{"doi-asserted-by":"publisher","key":"rf5","DOI":"10.1016\/j.chaos.2006.07.001"},{"doi-asserted-by":"publisher","key":"rf6","DOI":"10.1016\/j.chaos.2007.08.058"},{"key":"rf7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/00150517.1967.12431301","volume":"5","author":"Flores I.","journal-title":"Fibonacci Quart."},{"doi-asserted-by":"publisher","key":"rf9","DOI":"10.1016\/j.chaos.2005.12.054"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T15:45:34Z","timestamp":1746114334000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,19]]},"references-count":8,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2014,3,19]]},"published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1142\/S1793830914500177"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500177","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2014,3,19]]}}}