{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T17:54:25Z","timestamp":1719251665150},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,3,25]],"date-time":"2012-03-25T00:00:00Z","timestamp":1332633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10623-012-9635-0","type":"journal-article","created":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T09:28:27Z","timestamp":1332581307000},"page":"35-54","source":"Crossref","is-referenced-by-count":7,"title":["Hulls of codes from incidence matrices of connected regular graphs"],"prefix":"10.1007","volume":"70","author":[{"given":"D.","family":"Ghinelli","sequence":"first","affiliation":[]},{"given":"J. D.","family":"Key","sequence":"additional","affiliation":[]},{"given":"T. P.","family":"McDonough","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,25]]},"reference":[{"key":"9635_CR1","unstructured":"Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992). Cambridge Tracts in Mathematics, Vol.103 (Second printing with corrections, 1993)."},{"key":"9635_CR2","doi-asserted-by":"crossref","unstructured":"Biggs N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (Cambridge Tracts in Mathematics, Vol. 67) (1974).","DOI":"10.1017\/CBO9780511608704"},{"issue":"3\/4","key":"9635_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. Symbol. Comput. 24(3\/4), 235\u2013265 (1997)","journal-title":"J. Symbol. Comput."},{"key":"9635_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1022438616684","volume":"1","author":"A.E. Brouwer","year":"1992","unstructured":"Brouwer A.E., van Eijl C.J.: On the p-rank of the adjacency matrices of strongly regular graphs. J. Algebraic Comb. 1, 329\u2013346 (1992)","journal-title":"J. Algebraic Comb."},{"key":"9635_CR5","unstructured":"Brouwer A.: http:\/\/www.win.tue.nl\/~aeb\/graphs\/srg\/srgtab.html ."},{"key":"9635_CR6","unstructured":"Cameron P.J., van Lint J.H.: Designs, Graphs, Codes and Their Links. Cambridge University Press, Cambridge (London Mathematical Society Student Texts 22) (1991)."},{"key":"9635_CR7","unstructured":"Cannon J., Steel A., White G.: Linear codes over finite fields, Handbook of Magma Functions. In: Cannon, J., Bosma, W. (eds.) Computational Algebra Group, pp. 3951\u20134023. Department of Mathematics, University of Sydney, V2.13. http:\/\/magma.maths.usyd.edu.au\/magma (2006)."},{"key":"9635_CR8","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":"9635_CR9","unstructured":"Fish W., Key J.D., Mwambene E.: Codes from odd graphs (submitted)."},{"key":"9635_CR10","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 the incidence matrices and line graphs of Hamming graphs. Discret. Math. 310, 1884\u20131897 (2010)","journal-title":"Discret. Math."},{"key":"9635_CR11","first-page":"235","volume":"85","author":"W. Fish","year":"2011","unstructured":"Fish W., Key J.D., Mwambene E.: Binary codes from designs from the reflexive n-cube. Util. Math. 85, 235\u2013246 (2011)","journal-title":"Util. Math."},{"key":"9635_CR12","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.disc.2011.04.029","volume":"311","author":"W. Fish","year":"2011","unstructured":"Fish W., Key J.D., Mwambene E.: Codes from the incidence matrices of graphs on 3-sets. Discret. Math. 311, 1823\u20131840 (2011)","journal-title":"Discret. Math."},{"key":"9635_CR13","unstructured":"Fish W.: Codes from uniform subset graphs and cyclic products. PhD thesis, University of the Western Cape (2007)."},{"key":"9635_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3934\/amc.2011.5.93","volume":"5","author":"D. Ghinelli","year":"2011","unstructured":"Ghinelli D., Key J.D.: Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5, 93\u2013108 (2011)","journal-title":"Adv. Math. Commun."},{"key":"9635_CR15","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jctb.2000.2003","volume":"81","author":"C. Godsil","year":"2001","unstructured":"Godsil C., Royle G.: Chromatic number and the 2-rank of a graph. J. Comb. Theory, Ser. B 81, 142\u2013149 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9635_CR16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TIT.1982.1056504","volume":"28","author":"D.M. 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":"9635_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1026479210284","volume":"17","author":"W.H. Haemers","year":"1999","unstructured":"Haemers W.H., Peeters R., van Rijckevorsel J.M.: Binary codes of strongly regular graphs. Des. Codes Cryptogr. 17, 187\u2013209 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"9635_CR18","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/TIT.1968.1054190","volume":"14","author":"S.L. Hakimi","year":"1968","unstructured":"Hakimi S.L., Bredeson J.G.: Graph theoretic error-correcting codes. IEEE Trans. Inf. Theory 14, 584\u2013591 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9635_CR19","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/TIT.1965.1053789","volume":"11","author":"S.L. Hakimi","year":"1965","unstructured":"Hakimi S.L., Frank H.: Cut-set matrices and linear codes. IEEE Trans. Inf. Theory 11, 457\u2013458 (1965)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9635_CR20","unstructured":"Huffman W.C.: Codes and groups. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. 2, Part 2, Chap. 17, pp. 1345\u20131440. Elsevier, Amsterdam (1998)."},{"key":"9635_CR21","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/j.ejc.2004.04.007","volume":"26","author":"J.D. Key","year":"2005","unstructured":"Key J.D., McDonough T.P., Mavron V.C.: Partial permutation decoding for codes from finite planes. Eur. J. Comb 26, 665\u2013682 (2005)","journal-title":"Eur. J. Comb"},{"key":"9635_CR22","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ffa.2005.05.007","volume":"12","author":"J.D. 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":"9635_CR23","unstructured":"Key J.D., Moori J., Rodrigues B.G.: Codes from incidence matrices and line graphs of symplectic graphs (in press)."},{"key":"9635_CR24","first-page":"121","volume":"67","author":"J.D. Key","year":"2005","unstructured":"Key J.D., Moori J., Rodrigues B.G.: Some binary codes from symplectic geometry of odd characteristic. Util. Math 67, 121\u2013128 (2005)","journal-title":"Util. Math"},{"issue":"1\u20133","key":"9635_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.disc.2003.12.004","volume":"282","author":"J.D. 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":"9635_CR26","unstructured":"Key J.D., Moori J., Rodrigues B.G.: Permutation decoding for binary codes from triangular graphs. Eur. J. Comb. 25, 113\u2013123 (2004)."},{"key":"9635_CR27","doi-asserted-by":"crossref","first-page":"4663","DOI":"10.1016\/j.disc.2008.05.032","volume":"309","author":"J.D. 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."},{"issue":"3","key":"9635_CR28","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1504\/IJICOT.2010.032547","volume":"1","author":"J.D. 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 1(3), 334\u2013349 (2010)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"9635_CR29","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1016\/j.dam.2010.07.003","volume":"158","author":"J.D. Key","year":"2010","unstructured":"Key J.D., Rodrigues B.G.: Codes associated with lattice graphs, and permutation decoding. Discret. Appl. Math. 158, 1807\u20131815 (2010)","journal-title":"Discret. Appl. Math."},{"key":"9635_CR30","unstructured":"Key J.D., Seneviratne P.: Permutation decoding for binary self-dual codes from the graph Q n where n is even. In: Shaska T., Huffman W.C., Joyner D., Ustimenko V. (eds.) Advances in Coding Theory and Cryptology. Series on Coding Theory and Cryptology, vol. 2, pp. 152\u2013159. World Scientific Publishing Co. Pte. Ltd., Hackensack (2007)."},{"key":"9635_CR31","doi-asserted-by":"crossref","first-page":"2862","DOI":"10.1016\/j.disc.2006.06.049","volume":"308","author":"J.D. Key","year":"2008","unstructured":"Key J.D., Seneviratne P.: Permutation decoding of binary codes from lattice graphs. Discret. Math. 308, 2862\u20132867 (2008)","journal-title":"Discret. Math."},{"key":"9635_CR32","doi-asserted-by":"crossref","first-page":"373","DOI":"10.3934\/amc.2011.5.373","volume":"5","author":"J.D. 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) for k \u2265 2. Adv. Math. Commun 5, 373\u2013394 (2011)","journal-title":"Adv. Math. Commun"},{"key":"9635_CR33","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.disc.2004.11.020","volume":"301","author":"H.-J. Kroll","year":"2005","unstructured":"Kroll H.-J., Vincenti R.: PD-sets related to the codes of some classical varieties. Discret. Math. 301, 89\u2013105 (2005)","journal-title":"Discret. Math."},{"key":"9635_CR34","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","volume":"43","author":"F.J. 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":"9635_CR35","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1983)."},{"key":"9635_CR36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1013842904024","volume":"15","author":"R. Peeters","year":"2002","unstructured":"Peeters R.: On the p-ranks of the adjacency matrices of distance-regular graphs. J. Algebraic Comb. 15, 127\u2013149 (2002)","journal-title":"J. Algebraic Comb."},{"key":"9635_CR37","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. Pac. J. Math. 14, 1405\u20131411 (1964)","journal-title":"Pac. J. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9635-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9635-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9635-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:32Z","timestamp":1559246312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9635-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,25]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9635"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9635-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,25]]}}}