{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:44:30Z","timestamp":1649213070129},"reference-count":25,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p> We examine the [Formula: see text]-ary linear codes with respect to Lee metric from incidence matrix of the Lee graph with vertex set [Formula: see text] and two vertices being adjacent if their Lee distance is one. All the main parameters of the codes are obtained as [Formula: see text] if [Formula: see text] is odd and [Formula: see text] if [Formula: see text] is even. We examine also the [Formula: see text]-ary linear codes with respect to Hamming metric from incidence matrices of Desargues graph, Pappus graph, Folkman graph and the main parameters of the codes are [Formula: see text], respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding. <\/jats:p>","DOI":"10.1142\/s179383092150035x","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T10:59:25Z","timestamp":1602068365000},"page":"2150035","source":"Crossref","is-referenced-by-count":0,"title":["Codes from incidence matrices of some regular 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"}]},{"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,25]]},"reference":[{"key":"S179383092150035XBIB001","doi-asserted-by":"publisher","DOI":"10.1109\/12.403718"},{"key":"S179383092150035XBIB002","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1950-09407-5"},{"key":"S179383092150035XBIB003","first-page":"1","volume":"68","author":"Dankelmann P.","year":"2011","journal-title":"Des. Codes Cryptogr."},{"key":"S179383092150035XBIB004","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.2000.0473"},{"key":"S179383092150035XBIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-016-0310-y"},{"key":"S179383092150035XBIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.03.012"},{"key":"S179383092150035XBIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.02.010"},{"key":"S179383092150035XBIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.04.029"},{"key":"S179383092150035XBIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80069-3"},{"key":"S179383092150035XBIB010","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.93"},{"key":"S179383092150035XBIB011","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.373"},{"issue":"5","key":"S179383092150035XBIB012","first-page":"893","volume":"8","author":"Hauschild J.","year":"2015","journal-title":"Astropart. J. Math."},{"key":"S179383092150035XBIB013","doi-asserted-by":"publisher","DOI":"10.2140\/involve.2019.12.1329"},{"key":"S179383092150035XBIB014","doi-asserted-by":"publisher","DOI":"10.2307\/2371806"},{"key":"S179383092150035XBIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.05.007"},{"key":"S179383092150035XBIB016","first-page":"334","volume":"1","author":"Key J. D.","year":"2010","journal-title":"Int. J. Inf. Coding Theory"},{"key":"S179383092150035XBIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.08.001"},{"key":"S179383092150035XBIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.07.003"},{"key":"S179383092150035XBIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.008"},{"key":"S179383092150035XBIB020","doi-asserted-by":"publisher","DOI":"10.1109\/71.615436"},{"key":"S179383092150035XBIB021","volume-title":"Finite Geometrical Systems","author":"Levi F. W.","year":"1942"},{"key":"S179383092150035XBIB022","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"S179383092150035XBIB023","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"S179383092150035XBIB024","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830915500603"},{"key":"S179383092150035XBIB025","doi-asserted-by":"publisher","DOI":"10.2478\/s11533-011-0072-5"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092150035X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T09:05:46Z","timestamp":1626080746000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383092150035X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,25]]},"references-count":25,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1142\/S179383092150035X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092150035x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,25]]}}}