{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T07:15:46Z","timestamp":1697613346986},"reference-count":23,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1016\/j.jsc.2010.03.012","type":"journal-article","created":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T14:29:25Z","timestamp":1269613765000},"page":"800-812","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Binary codes from the line graph of the n<\/mml:mi><\/mml:math>-cube"],"prefix":"10.1016","volume":"45","author":[{"given":"W.","family":"Fish","sequence":"first","affiliation":[]},{"given":"J.D.","family":"Key","sequence":"additional","affiliation":[]},{"given":"E.","family":"Mwambene","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2010.03.012_b1","series-title":"Designs and their Codes","volume":"vol. 103","author":"Assmus","year":"1992"},{"issue":"3\/4","key":"10.1016\/j.jsc.2010.03.012_b2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","article-title":"The magma algebra system I: the user language","volume":"24","author":"Bosma","year":"1997","journal-title":"J. Symb. Comp."},{"key":"10.1016\/j.jsc.2010.03.012_b3","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/j.jsc.2010.03.012_b4","series-title":"Handbook of Magma Functions","first-page":"3951","article-title":"Linear codes over finite fields","volume":"V2.13","author":"Cannon","year":"2006"},{"issue":"1\u20134","key":"10.1016\/j.jsc.2010.03.012_b5","first-page":"169","article-title":"Codes, designs and groups from the Hamming graphs","volume":"34","author":"Fish","year":"2009","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/j.jsc.2010.03.012_b6","doi-asserted-by":"crossref","first-page":"3255","DOI":"10.1016\/j.disc.2008.09.024","article-title":"Graphs, designs and codes related to the n-cube","volume":"309","author":"Fish","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.jsc.2010.03.012_b7","unstructured":"Fish, Washiela, 2007. Codes from uniform subset graphs and cyclic products. Ph.D. Thesis, University of the Western Cape."},{"key":"10.1016\/j.jsc.2010.03.012_b8","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.jsc.2010.03.012_b9","first-page":"136","article-title":"The automorphism group of the hypercube","volume":"6","author":"Harary","year":"2000","journal-title":"J. UCS."},{"key":"10.1016\/j.jsc.2010.03.012_b10","series-title":"Handbook of Coding Theory","first-page":"1345","article-title":"Codes and groups","author":"Cary Huffman","year":"1998"},{"key":"10.1016\/j.jsc.2010.03.012_b11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/j.ejc.2004.04.007","article-title":"Partial permutation decoding for codes from finite planes","volume":"26","author":"Key","year":"2005","journal-title":"European J. Combin."},{"key":"10.1016\/j.jsc.2010.03.012_b12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ffa.2005.05.007","article-title":"Information sets and partial permutation decoding for codes from finite geometries","volume":"12","author":"Key","year":"2006","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.jsc.2010.03.012_b13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ejc.2005.09.001","article-title":"Binary codes from rectangular lattice graphs and permutation decoding","volume":"28","author":"Key","year":"2006","journal-title":"European J. Combin."},{"key":"10.1016\/j.jsc.2010.03.012_b14","series-title":"Advances in Coding Theory and Cryptology","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1142\/9789812772022_0010","article-title":"Permutation decoding for binary self-dual codes from the graph Qn where n is even","volume":"vol. 2","author":"Key","year":"2007"},{"key":"10.1016\/j.jsc.2010.03.012_b15","doi-asserted-by":"crossref","first-page":"2862","DOI":"10.1016\/j.disc.2006.06.049","article-title":"Permutation decoding of binary codes from lattice graphs","volume":"308","author":"Key","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.jsc.2010.03.012_b16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.disc.2004.11.020","article-title":"PD-sets related to the codes of some classical varieties","volume":"301","author":"Kroll","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.jsc.2010.03.012_b17","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.jsc.2010.03.012_b18","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1983"},{"key":"10.1016\/j.jsc.2010.03.012_b19","first-page":"5","article-title":"The use of information sets in decoding cyclic codes","volume":"IT-8","author":"Prange","year":"1962","journal-title":"IRE Trans."},{"key":"10.1016\/j.jsc.2010.03.012_b20","unstructured":"Royle, Gordon F., Colouring the cube. Preprint."},{"key":"10.1016\/j.jsc.2010.03.012_b21","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.jsc.2010.03.012_b22","unstructured":"Seneviratne, Padmapani, 2007. Permutation decoding of codes from graphs and designs. Ph.D. Thesis, Clemson University."},{"key":"10.1016\/j.jsc.2010.03.012_b23","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":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110000490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110000490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T09:10:41Z","timestamp":1660295441000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717110000490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S0747717110000490"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2010.03.012","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Binary codes from the line graph of the -cube","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2010.03.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2010 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}