{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:30:05Z","timestamp":1747189805390,"version":"3.40.5"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research","doi-asserted-by":"publisher","award":["25(0249)\/16\/EMR-II"],"award-info":[{"award-number":["25(0249)\/16\/EMR-II"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p> We examine the [Formula: see text]-ary linear codes from incidence matrix of the Bouwer graph [Formula: see text] with vertex set [Formula: see text] and two vertices are adjacent if they can be written as [Formula: see text] and [Formula: see text] where either [Formula: see text] or [Formula: see text] differs from [Formula: see text] in exactly one position, say the [Formula: see text]th position, where [Formula: see text] All the main parameters of the codes are obtained as [Formula: see text] Also, we determine linear codes from incidence matrices of Bouwer graphs [Formula: see text] and all the main parameters of the codes are obtained as [Formula: see text] All the above codes can be used for full error correction by permutation decoding. <\/jats:p>","DOI":"10.1142\/s1793830921500270","type":"journal-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T04:08:30Z","timestamp":1600488510000},"page":"2150027","source":"Crossref","is-referenced-by-count":0,"title":["Codes from incidence matrices of some Bouwer graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"R.","family":"Saranya","sequence":"first","affiliation":[{"name":"Department of Mathematics, School of Mathematical Sciences, Bharathidasan University, Tiruchirappalli, Tamilnadu-620024, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0235-3611","authenticated-orcid":false,"given":"C.","family":"Durairajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Mathematical Sciences, Bharathidasan University, Tiruchirappalli, Tamilnadu-620024, India"}]}],"member":"219","published-online":{"date-parts":[[2020,11,7]]},"reference":[{"key":"S1793830921500270BIB001","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1970-047-8"},{"key":"S1793830921500270BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2"},{"key":"S1793830921500270BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2015.12.011"},{"key":"S1793830921500270BIB004","first-page":"1","volume":"68","author":"Dankelmann P.","year":"2011","journal-title":"Des. Codes Cryptogr."},{"key":"S1793830921500270BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.02.010"},{"key":"S1793830921500270BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.04.029"},{"key":"S1793830921500270BIB007","doi-asserted-by":"publisher","DOI":"10.2478\/s11533-011-0072-5"},{"key":"S1793830921500270BIB008","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.93"},{"key":"S1793830921500270BIB009","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.373"},{"key":"S1793830921500270BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.08.001"},{"key":"S1793830921500270BIB011","first-page":"334","volume":"1","author":"Key J. D.","year":"2010","journal-title":"Int. J. Inf. Coding Theory"},{"key":"S1793830921500270BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.008"},{"key":"S1793830921500270BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.07.003"},{"key":"S1793830921500270BIB014","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"S1793830921500270BIB015","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"S1793830921500270BIB016","doi-asserted-by":"publisher","DOI":"10.2140\/involve.2019.12.1329"},{"key":"S1793830921500270BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830915500603"},{"key":"S1793830921500270BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S1005386718000330"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T07:27:24Z","timestamp":1619594844000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,7]]},"references-count":18,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S1793830921500270"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500270","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,11,7]]}}}