{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:23:56Z","timestamp":1773260636462,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,30]],"date-time":"2014-11-30T00:00:00Z","timestamp":1417305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00200-014-0238-z","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T18:47:08Z","timestamp":1417459628000},"page":"227-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Self-dual codes from 3-class association schemes"],"prefix":"10.1007","volume":"26","author":[{"given":"M.","family":"Bilal","sequence":"first","affiliation":[]},{"given":"J.","family":"Borges","sequence":"additional","affiliation":[]},{"given":"S. T.","family":"Dougherty","sequence":"additional","affiliation":[]},{"given":"C.","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,30]]},"reference":[{"issue":"4","key":"238_CR1","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1109\/18.761269","volume":"45","author":"E Bannai","year":"1999","unstructured":"Bannai, E., Dougherty, S.T., Harada, M., Oura, M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inform. Theory 45(4), 1194\u20131205 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"238_CR2","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/18.825812","volume":"46","author":"S Bouyuklieva","year":"2000","unstructured":"Bouyuklieva, S.: A method for constructing self-dual codes with an automorphism of order 2. IEEE Trans. Inform. Theory 46(2), 496\u2013504 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"238_CR3","doi-asserted-by":"crossref","first-page":"3933","DOI":"10.1109\/TIT.2012.2190134","volume":"58","author":"S Bouyuklieva","year":"2012","unstructured":"Bouyuklieva, S., Bouyukliev, I.: An algorithm for classification of binary self-dual codes. IEEE Trans. Inform. Theory 58(6), 3933\u20133940 (2012)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"238_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3934\/amc.2011.5.191","volume":"5","author":"S Bouyuklieva","year":"2011","unstructured":"Bouyuklieva, S., Varbanov, Z.: Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Adv. Math. Commun. 5(2), 191\u2013198 (2011)","journal-title":"Adv. Math. Commun."},{"key":"238_CR5","first-page":"193","volume":"85","author":"ST Dougherty","year":"2007","unstructured":"Dougherty, S.T., Gulliver, T.A., Ramadurai, R.: Symmetric designs and self-dual codes over rings. Ars Combin. 85, 193\u2013209 (2007)","journal-title":"Ars Combin."},{"issue":"1","key":"238_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ffa.2009.11.004","volume":"16","author":"ST Dougherty","year":"2010","unstructured":"Dougherty, S.T., Kim, J.L., Kulosman, H., Liu, Hongwei: Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 16(1), 14\u201326 (2010)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"238_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1504\/IJICOT.2010.032133","volume":"1","author":"ST Dougherty","year":"2010","unstructured":"Dougherty, S.T., Kim, J.L., Liu, H.: Constructions of self-dual codes over finite commutative chain rings. Int. J. Inf. Coding Theory 1(2), 171\u2013190 (2010)","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"1","key":"238_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.3934\/amc.2007.1.45","volume":"1","author":"ST Dougherty","year":"2007","unstructured":"Dougherty, S.T., Kim, J.L., Sol\u00e9, P.: Double circulant codes from two class association schemes. AMC 1(1), 45\u201364 (2007)","journal-title":"AMC"},{"key":"238_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00147398","volume":"4","author":"DG Higman","year":"1975","unstructured":"Higman, D.G.: Coherent configurations. Geom. Dedicata 4, 1\u201332 (1975)","journal-title":"Geom. Dedicata"},{"key":"238_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.S.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"238_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566066","volume-title":"Design Theory","author":"DR Hughes","year":"1985","unstructured":"Hughes, D.R., Piper, F.C.: Design Theory. Cambridge University Press, Cambridge (1985)"},{"key":"238_CR12","unstructured":"J\u00f8rgensen, L.K.: Non-symmetric 3-class association schemes: Research Report Series; R-2005-13 Aalborg Universitetsforlag (2005)"},{"issue":"2","key":"238_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.3934\/amc.2012.6.193","volume":"6","author":"S Karadeniz","year":"2012","unstructured":"Karadeniz, S., Yildiz, B.: Double-circulant and bordered-double-circulant constructions for self-dual codes over R2. Adv. Math. Commun. 6(2), 193\u2013202 (2012)","journal-title":"Adv. Math. Commun."},{"key":"238_CR14","unstructured":"Lam, C.W.H.: The search for a finite projective plane of order 10 [MR1103185 (92b:51013)]. Organic mathematics (Burnaby, BC, 1995), pp. 335\u2013355, CMS Conf. Proc., 20, Am. Math. Soc., Providence, RI (1997)"},{"key":"238_CR15","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1981","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1981)"},{"key":"238_CR16","unstructured":"Nebe, G., Rains, E.M., Sloane, N.J.: Self-dual codes and invariant theory. Algorithms and Computation in Mathematics, 17. Springer-Verlag, Berlin, xxviii+430 pp. ISBN: 978-3-540-30729-7; 3-540-30729-X (2006)"},{"key":"238_CR17","unstructured":"Rains, E., Sloane, N.J.A.: Self-dual Codes in the Handbook of Coding Theory, V.S. Pless and W.C. Huffman, pp. 177\u2013294. Elsevier, Amsterdam (1998)"},{"key":"238_CR18","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, P.: Self-dual Codes and Self-dual Designs. IMA Volumes 20, pp. 188\u2013192. Springer, Berlin (1990)","DOI":"10.1007\/978-1-4613-8994-1_14"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0238-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-014-0238-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-014-0238-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T01:01:15Z","timestamp":1566090075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-014-0238-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,30]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s00200-014-0238-z","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,30]]}}}