{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:10:05Z","timestamp":1747483805102,"version":"3.40.5"},"reference-count":12,"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":[[2015,6]]},"abstract":"<jats:p>In this paper, we introduced h(x) extension of m sequences of Fibonacci numbers polynomials of order m and a new S<jats:sub>n<\/jats:sub>matrix of order m where h(x)(&gt; 0) is a polynomial with real coefficients. Thereby, we discuss various properties of S<jats:sub>n<\/jats:sub>matrix and the Fibonacci coding theory followed from this matrix. We established the relations among the code matrix elements, error deduction and correction for this coding theory. In general, correct ability potential of this method increases and it is independent of h(x). But h(x) being a polynomial, improves the cryptography protection.<\/jats:p>","DOI":"10.1142\/s1793830915500081","type":"journal-article","created":{"date-parts":[[2015,1,22]],"date-time":"2015-01-22T08:34:41Z","timestamp":1421915681000},"page":"1550008","source":"Crossref","is-referenced-by-count":0,"title":["Coding theory on h(x) extension of m sequences for Fibonacci numbers"],"prefix":"10.1142","volume":"07","author":[{"given":"Bandhu","family":"Prasad","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kandi Raj College, Kandi 742137, India"}]}],"member":"219","published-online":{"date-parts":[[2015,5,25]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2008.09.030"},{"volume-title":"The Theory and Practice of Error Control Codes","year":"1983","author":"Blahut R.","key":"rf2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"rf4","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1080\/00150517.1984.12429883","volume":"22","author":"Er M. C.","year":"1984","journal-title":"Fibonacci Quart."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2009.01.007"},{"volume-title":"Elementary Matrix Algebra","year":"1973","author":"Hohn F. E.","key":"rf6"},{"volume-title":"Theory of Error-Correcting Codes","year":"1977","author":"MacWilliams F. J.","key":"rf7"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1960.11989593"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2009.04.048"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2008.09.059"},{"volume-title":"Introduction into Algorithm Measurement Theory","year":"1977","author":"Stakhov A. P.","key":"rf11"},{"key":"rf12","doi-asserted-by":"publisher","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\/S1793830915500081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T11:41:10Z","timestamp":1747482070000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,25]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2015,5,25]]},"published-print":{"date-parts":[[2015,6]]}},"alternative-id":["10.1142\/S1793830915500081"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500081","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2015,5,25]]}}}