{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:23:38Z","timestamp":1780763018736,"version":"3.54.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p>In [K. Kuhapatanakul, The Lucas [Formula: see text]-matrix, Internat. J. Math. Ed. Sci. Tech. (2015), http:\/\/dx.doi.org\/10.1080\/0020739X.2015.1026612], Kuhapatanakul introduced Lucas [Formula: see text] matrix, [Formula: see text] whose elements are Lucas [Formula: see text] numbers. In this paper, we developed a new coding and decoding method followed from Lucas [Formula: see text] matrix, [Formula: see text]. We established the relations among the code matrix elements, error detection and correction for this coding theory. Correction ability of this method is [Formula: see text]% for [Formula: see text] and for [Formula: see text], the correction ability is [Formula: see text]%. In general, correction ability of this method increases as [Formula: see text] increases.<\/jats:p>","DOI":"10.1142\/s1793830916500749","type":"journal-article","created":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T03:44:13Z","timestamp":1474861453000},"page":"1650074","source":"Crossref","is-referenced-by-count":20,"title":["Coding theory on Lucas p numbers"],"prefix":"10.1142","volume":"08","author":[{"given":"Bandhu","family":"Prasad","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kandi Raj College, Kandi-742137, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"S1793830916500749BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2010.01.013"},{"key":"S1793830916500749BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2008.09.030"},{"issue":"4","key":"S1793830916500749BIB003","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/00150517.1963.12431555","volume":"1","author":"Bruggles I. D.","year":"1963","journal-title":"Fibonacci Quart."},{"key":"S1793830916500749BIB004","volume-title":"Elementary Matrix Algebra","author":"Hohn F. E.","year":"1973"},{"key":"S1793830916500749BIB005","doi-asserted-by":"publisher","DOI":"10.1080\/0020739X.2015.1026612"},{"key":"S1793830916500749BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2007.08.058"},{"key":"S1793830916500749BIB007","first-page":"46","volume":"9","author":"Stakhov A. P.","year":"1999","journal-title":"Rep. Nat. Acad. Sci. Ukraine"},{"key":"S1793830916500749BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2005.12.054"},{"key":"S1793830916500749BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2005.04.106"},{"key":"S1793830916500749BIB010","volume-title":"Fibonacci and Lucas Numbers and the Golden Section","author":"Vajda S.","year":"1989"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T21:16:33Z","timestamp":1749590193000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,8]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,11,8]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1142\/S1793830916500749"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500749","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,8]]}}}