{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T12:59:01Z","timestamp":1717592341487},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/j.ejc.2003.08.001","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:32:50Z","timestamp":1063737170000},"page":"113-123","source":"Crossref","is-referenced-by-count":36,"title":["Permutation decoding for the binary codes from triangular graphs"],"prefix":"10.1016","volume":"25","author":[{"given":"J.D.","family":"Key","sequence":"first","affiliation":[]},{"given":"J.","family":"Moori","sequence":"additional","affiliation":[]},{"given":"B.G.","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2003.08.001_B1","series-title":"Designs and their Codes","author":"Assmus","year":"1992"},{"key":"10.1016\/j.ejc.2003.08.001_B2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1027359905521","article-title":"Designs and codes: an update","volume":"9","author":"Assmus","year":"1996","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ejc.2003.08.001_B3","unstructured":"W. Bosma, J. Cannon, Handbook of Magma Functions, Department of Mathematics, University of Sydney, November 1994. Available from http:\/\/www.maths.usyd.edu.au:8000\/u\/magma\/"},{"key":"10.1016\/j.ejc.2003.08.001_B4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1022438616684","article-title":"On the p-rank of the adjacency matrices of strongly regular graphs","volume":"1","author":"Brouwer","year":"1992","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.ejc.2003.08.001_B5","series-title":"Enumeration and Design","first-page":"85","article-title":"Strongly regular graphs and partial geometries","author":"Brouwer","year":"1984"},{"key":"10.1016\/j.ejc.2003.08.001_B6","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TIT.1982.1056504","article-title":"Minimal permutation sets for decoding the binary Golay codes","volume":"28","author":"Gordon","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.ejc.2003.08.001_B7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1026479210284","article-title":"Binary codes of strongly regular graphs","volume":"17","author":"Haemers","year":"1999","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ejc.2003.08.001_B8","series-title":"Handbook of Coding Theory","first-page":"1345","article-title":"Codes and groups","volume":"vol. 2","author":"Huffman","year":"1998"},{"key":"10.1016\/j.ejc.2003.08.001_B9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","article-title":"Permutation decoding of systematic codes","volume":"43","author":"MacWilliams","year":"1964","journal-title":"Bell System Tech. J."},{"key":"10.1016\/j.ejc.2003.08.001_B10","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1983"},{"key":"10.1016\/j.ejc.2003.08.001_B11","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","article-title":"On coverings","volume":"14","author":"Sch\u00f6nheim","year":"1964","journal-title":"Pacific J. Math."},{"key":"10.1016\/j.ejc.2003.08.001_B12","article-title":"Combinatorial Configurations, Designs, Codes, Graphs","volume":"vol. 40","author":"Tonchev","year":"1988"},{"key":"10.1016\/j.ejc.2003.08.001_B13","doi-asserted-by":"crossref","first-page":"154","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803001240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803001240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:24:43Z","timestamp":1550978683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669803001240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0195669803001240"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2003.08.001","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}