{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:51:35Z","timestamp":1764276695431},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00200-013-0198-8","type":"journal-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T11:50:02Z","timestamp":1372161002000},"page":"225-236","source":"Crossref","is-referenced-by-count":6,"title":["Permutation decoding of codes from generalized Paley graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Padmapani","family":"Seneviratne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jirapha","family":"Limbupasiriporn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"key":"198_CR1","unstructured":"Assmus, E.F., Jr, Key, J.D.: Designs and their codes. Cambridge: Cambridge University Press, Cambridge Tracts in Mathematics, vol. 103 (1992) (Second printing with corrections, 1993)"},{"key":"198_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/jgt.3190030311","volume":"3","author":"CRJ Clapham","year":"1979","unstructured":"Clapham, C.R.J.: A class of self-complementary graphs and lower bounds of some Ramsey numbers. J. Graph Theory 3, 287\u2013289 (1979)","journal-title":"J. Graph Theory"},{"key":"198_CR3","doi-asserted-by":"crossref","unstructured":"Dankelmann, P., Key, J.D., Rodrigues, B.G.: Codes from incidence matrices of graphs. Des. Codes Cryptogr (2012). doi: 10.1007\/s10623-011-9594-x","DOI":"10.1007\/s10623-011-9594-x"},{"key":"198_CR4","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.disc.2010.02.010","volume":"310","author":"W Fish","year":"2010","unstructured":"Fish, W., Key, J.D., Mwambene, E.: Codes from incidence matrices and line graphs of Hamming graphs. Discrete Math. 310, 1884\u20131897 (2010)","journal-title":"Discrete Math."},{"issue":"1","key":"198_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3934\/amc.2011.5.93","volume":"5","author":"D Ghinellie","year":"2011","unstructured":"Ghinellie, D., Key, J.D.: Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5(1), 93\u2013108 (2011)","journal-title":"Adv. Math. Commun."},{"key":"198_CR6","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics 207. Springer, New York (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"198_CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TIT.1982.1056504","volume":"28","author":"DM Gordon","year":"1982","unstructured":"Gordon, D.M.: Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inf. Theory 28, 541\u2013543 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"198_CR8","unstructured":"Huffman, W. C.: Codes and groups. In: Pless, V.S., Huffman, W.C. (eds). Handbook of Coding Theory, Amsterdam: Elsevier, vol. 2, Part 2, pp. 1345\u20131440. Chapter 17 (1998)"},{"key":"198_CR9","first-page":"143","volume":"170","author":"JD Key","year":"2004","unstructured":"Key, J.D., Limbupasiriporn, J.: Partial permutation decoding for codes from Paley graphs. Congr. Numer. 170, 143\u2013155 (2004)","journal-title":"Congr. Numer."},{"key":"198_CR10","doi-asserted-by":"crossref","first-page":"2862","DOI":"10.1016\/j.disc.2006.06.049","volume":"308","author":"JD Key","year":"2008","unstructured":"Key, J.D., Seneviratne, P.: Binary codes from rectangular lattice graphs and permutation decoding. Discrete Math. 308, 2862\u20132867 (2008)","journal-title":"Discrete Math."},{"key":"198_CR11","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ffa.2005.05.007","volume":"12","author":"JD Key","year":"2006","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Information sets and partial permutation decoding for codes from finite geometries. Finite Fields Appl. 12, 232\u2013247 (2006)","journal-title":"Finite Fields Appl."},{"key":"198_CR12","doi-asserted-by":"crossref","first-page":"3114","DOI":"10.1016\/j.disc.2009.06.001","volume":"310","author":"JD Key","year":"2010","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Reed-Muller codes and permutation decoding. Discrete Math. 310, 3114\u20133119 (2010)","journal-title":"Discrete Math."},{"key":"198_CR13","first-page":"334","volume":"13","author":"JD Key","year":"2010","unstructured":"Key, J.D., Moori, J., Rodrigues, B.G.: Codes associated with triangular graphs, and permutation decoding. Int. J. Inf. Coding Theory 13, 334\u2013349 (2010)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"198_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.3934\/amc.2011.5.373","volume":"5","author":"JD Key","year":"2011","unstructured":"Key, J.D., Fish, W., Mwambene, E.: Codes from the incidence matrices and line graphs of Hamming graphs $$H^k(n,2)$$ H k ( n , 2 ) for $$k\\ge 2$$ k \u2265 2 . Adv. Math. Commun. 5, 373\u2013394 (2011)","journal-title":"Adv. Math. Commun."},{"key":"198_CR15","first-page":"294","volume":"58","author":"TK Lim","year":"2009","unstructured":"Lim, T.K., Praeger, C.E.: On generalised Paley graphs and their automorphism groups. Michigan Math. J. 58, 294\u2013308 (2009)","journal-title":"Michigan Math. J."},{"key":"198_CR16","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","volume":"43","author":"FJ MacWilliams","year":"1964","unstructured":"MacWilliams, F.J.: Permutation decoding of systematic codes. Bell Syst. Tech. J. 43, 485\u2013505 (1964)","journal-title":"Bell Syst. Tech. J."},{"key":"198_CR17","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1998","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1998)"},{"key":"198_CR18","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J Sch\u00f6nheim","year":"1964","unstructured":"Sch\u00f6nheim, J.: On coverings. Pacific J. Math. 14, 1405\u20131411 (1964)","journal-title":"Pacific J. Math."},{"key":"198_CR19","unstructured":"Seneviratne, P.: Graph cycles and codes. Preprint"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-013-0198-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-013-0198-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-013-0198-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:24:24Z","timestamp":1558625064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-013-0198-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":19,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s00200-013-0198-8","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,26]]}}}