{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:42Z","timestamp":1740107142650,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00373-017-1862-8","type":"journal-article","created":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T11:56:05Z","timestamp":1512129365000},"page":"163-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Codes from Adjacency Matrices of Uniform Subset Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"W.","family":"Fish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1487-8127","authenticated-orcid":false,"given":"J. D.","family":"Key","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mwambene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,1]]},"reference":[{"key":"1862_CR1","unstructured":"Araujo, J., Bratten, T.: On the spectrum of the Johnson graphs \n                        $${J}(n,k,r)$$\n                        \n                            \n                                \n                                    J\n                                    (\n                                    n\n                                    ,\n                                    k\n                                    ,\n                                    r\n                                    )\n                                \n                            \n                        \n                    . In: Proceedings of the XXIIrd \u201cDr. Antonio A. R. Monteiro\u201d Congress, pp. 57\u201362 (2016). Univ. Nac. Sur Dep. Mat. Inst. Mat., Baha Blanca, 2015"},{"key":"1862_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus Jr","year":"1992","unstructured":"Assmus Jr., E.F., Key, J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992). Cambridge Tracts in Mathematics, Vol.\u00a0103 (Second printing with corrections, 1993)"},{"issue":"3\/4","key":"1862_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3\/4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"1862_CR4","unstructured":"Brouwer, A., Haemers, W.: Association schemes. In: Graham, R., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, Chapter\u00a015, Vol.\u00a01, pp. 749\u2013771. Elsevier; MIT, Cambridge (1995)"},{"key":"1862_CR5","unstructured":"Cannon, J., Steel, A., White, G.: Linear codes over finite fields. In: Cannon, J., Bosma, W. (eds.) Handbook of Magma Functions, pp. 3951\u20134023. Computational Algebra Group, Department of Mathematics, University of Sydney (2006). V2.13. \n                        http:\/\/magma.maths.usyd.edu.au\/magma"},{"key":"1862_CR6","unstructured":"Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. Tech. rep., Philips Research Laboratorie (1973). Philips Research Reports, Supplement No.\u00a010"},{"key":"1862_CR7","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte, P., Levenshtein, V.I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477\u20132504 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1862_CR8","unstructured":"Fish, W.: Codes from uniform subset graphs and cycle products. Ph.D. thesis, University of the Western Cape (2007)"},{"key":"1862_CR9","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1007\/s00373-014-1485-2","volume":"31","author":"W Fish","year":"2015","unstructured":"Fish, W.: Binary codes and partial permutation decoding sets from the Johnson graphs. Graphs Comb. 31, 1381\u20131396 (2015)","journal-title":"Graphs Comb."},{"issue":"9","key":"1862_CR10","first-page":"1362","volume":"12","author":"W Fish","year":"2014","unstructured":"Fish, W., Fray, R., Mwambene, E.: Binary codes and partial permutation decoding sets from the odd graphs. Cent. Eur. J. Math. 12(9), 1362\u20131371 (2014)","journal-title":"Cent. Eur. J. Math."},{"key":"1862_CR11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00200-014-0233-4","volume":"25","author":"W Fish","year":"2014","unstructured":"Fish, W., Key, J.D., Mwambene, E.: Ternary codes from reflexive graphs on \n                        $$3$$\n                        \n                            \n                                \n                                    3\n                                \n                            \n                        \n                    -sets. Appl. Algebra Eng. Commun. Comput. 25, 363\u2013382 (2014)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1862_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3934\/amc.2015.9.211","volume":"9","author":"W Fish","year":"2015","unstructured":"Fish, W., Key, J.D., Mwambene, E.: Binary codes from reflexive graphs on \n                        $$3$$\n                        \n                            \n                                \n                                    3\n                                \n                            \n                        \n                    -sets. Adv. Math. Commun. 9, 211\u2013232 (2015)","journal-title":"Adv. Math. Commun."},{"key":"1862_CR13","unstructured":"Huffman, W.C.: Codes and groups. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, vol. 2, Part\u00a02, Chapter\u00a017, pp. 1345\u20131440. Elsevier, Amsterdam (1998)"},{"issue":"1\u20133","key":"1862_CR14","first-page":"171","volume":"282","author":"JD Key","year":"2004","unstructured":"Key, J.D., Moori, J., Rodrigues, B.G.: Binary codes from graphs on triples. Discret. Math. 282(1\u20133), 171\u2013182 (2004)","journal-title":"Discret. Math."},{"key":"1862_CR15","doi-asserted-by":"crossref","first-page":"4663","DOI":"10.1016\/j.disc.2008.05.032","volume":"309","author":"JD Key","year":"2009","unstructured":"Key, J.D., Moori, J., Rodrigues, B.G.: Ternary codes from graphs on triples. Discret. Math. 309, 4663\u20134681 (2009)","journal-title":"Discret. Math."},{"key":"1862_CR16","doi-asserted-by":"publisher","unstructured":"Key, J.D., Rodrigues, B.G.: \n                        $$LCD$$\n                        \n                            \n                                \n                                    LCD\n                                \n                            \n                        \n                     codes from adjacency matrices of graphs. (To appear) Appl. Algebra Eng. Commun. Comput. \n                        https:\/\/doi.org\/10.1007\/s00200-017-0339-6","DOI":"10.1007\/s00200-017-0339-6"},{"key":"1862_CR17","first-page":"191","volume":"2","author":"TP Kirkman","year":"1847","unstructured":"Kirkman, T.P.: On a problem in combinations. Camb. Dublin Math. J. 2, 191\u2013204 (1847)","journal-title":"Camb. Dublin Math. J."},{"key":"1862_CR18","doi-asserted-by":"crossref","first-page":"154","DOI":"10.13001\/1081-3810.1256","volume":"17","author":"M Krebs","year":"2008","unstructured":"Krebs, M., Shaheen, A.: On the spectra of Johnson graphs. Electron. J. Linear Algebra 17, 154\u2013167 (2008)","journal-title":"Electron. J. Linear Algebra"},{"issue":"107","key":"1862_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discret. Math. 106(107), 337\u2013342 (1992)","journal-title":"Discret. Math."},{"key":"1862_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01443649","volume":"43","author":"EH Moore","year":"1893","unstructured":"Moore, E.H.: Concerning triple systems. Math. Ann. 43, 271\u2013285 (1893)","journal-title":"Math. Ann."},{"key":"1862_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1013842904024","volume":"15","author":"R Peeters","year":"2002","unstructured":"Peeters, R.: On the \n                        $$p$$\n                        \n                            \n                                p\n                            \n                        \n                    -ranks of the adjacency matrices of distance-regular graphs. J. Algebraic Comb. 15, 127\u2013149 (2002)","journal-title":"J. Algebraic Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1862-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1862-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1862-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T12:04:50Z","timestamp":1517832290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1862-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1862"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1862-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}