{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T06:46:58Z","timestamp":1750661218673},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s00200-022-00567-2","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T15:04:09Z","timestamp":1657724649000},"page":"545-556","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Construction of self dual codes from graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Nazahet","family":"Fellah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferruh","family":"\u00d6zbudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padmapani","family":"Seneviratne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"567_CR1","unstructured":"Assmus, E.F., Jr., Key, J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992) (Second printing with corrections 1993)"},{"key":"567_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., G\u00e1l, A., Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T., Wigderson, A.: Extremal bipartite graphs and superpolynomial lowerbounds for monotone span programs. In: Proceedings of ACM STOC\u201996, pp. 603\u2013611","DOI":"10.1145\/237814.238010"},{"key":"567_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s12095-017-0271-4","volume":"10","author":"C Carlet","year":"2018","unstructured":"Carlet, C., Guilley, S.: Statistical properties of side-channel and fault injection attacks using coding theory. Cryptogr. Commun. 10, 909\u2013933 (2018)","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"567_CR4","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"JH Conway","year":"1990","unstructured":"Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6), 1319\u20131333 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"567_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jcta.2001.3198","volume":"97","author":"P Gaborit","year":"2002","unstructured":"Gaborit, P.: Quadratic double circulant codes over fields. J. Comb. Theory Ser. A 97(1), 85\u2013107 (2002)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"567_CR6","doi-asserted-by":"publisher","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(1), 93\u2013108 (2011)","journal-title":"Adv. Math. Commun."},{"key":"567_CR7","unstructured":"Grassl, M.: Code tables. http:\/\/www.codetables.de"},{"issue":"6","key":"567_CR8","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.1109\/18.641574","volume":"43","author":"ST Dougherty","year":"1997","unstructured":"Dougherty, S.T., Gulliver, T.A., Harada, M.: Extremal binary self-dual codes. IEEE Trans. Inf. Theory 43(6), 2036\u20132047 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"567_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1090\/S0002-9939-1954-0060527-3","volume":"5","author":"JB Kelley","year":"1954","unstructured":"Kelley, J.B.: A characteristic property of quadratic residues. Proc. Am. Math. Soc. 5(1), 38\u201346 (1954)","journal-title":"Proc. Am. Math. Soc."},{"key":"567_CR10","first-page":"143","volume":"170","author":"JD Key","year":"2005","unstructured":"Key, J.D., Limbupasiriporn, J.: Partial permutation decoding for codes from Paley graphs. Congr. Numer. 170, 143\u2013155 (2005)","journal-title":"Congr. Numer."},{"issue":"5","key":"567_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/00029890.1913.11997943","volume":"20","author":"DN Lehmer","year":"1913","unstructured":"Lehmer, D.N.: Certain Theorems in the theory of quadratic residues. Am. Math. Mon. 20(5), 151\u2013157 (1913)","journal-title":"Am. Math. Mon."},{"key":"567_CR12","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1983","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 1st edn. North-Holland Mathematical Library, Amsterdam (1983)","edition":"1"},{"key":"567_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"CL Mallows","year":"1973","unstructured":"Mallows, C.L., Sloane, N.J.A.: An upper bound for self-dual codes. Inf. Control 22, 188\u2013200 (1973)","journal-title":"Inf. Control"},{"issue":"1","key":"567_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.3934\/amc.2020007","volume":"14","author":"H Massaki","year":"2020","unstructured":"Massaki, H.: New doubly even self-dual codes having minimum weight 20. Adv. Math. Commun. 14(1), 89\u201396 (2020)","journal-title":"Adv. Math. Commun."},{"key":"567_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/sapm1933121311","volume":"12","author":"REAC Paley","year":"1933","unstructured":"Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311\u2013320 (1933)","journal-title":"J. Math. Phys."},{"key":"567_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BF01175029","volume":"56","author":"O Perron","year":"1952","unstructured":"Perron, O.: Bemerkungen \u00dcber die Verteilung der quadratische Reste. Math. Z. 56, 122\u2013130 (1952)","journal-title":"Math. Z."},{"issue":"1\u20133","key":"567_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V Pless","year":"1972","unstructured":"Pless, V.: A classification of self-orthogonal codes over GF(2). Discrete Math. 3(1\u20133), 209\u2013246 (1972)","journal-title":"Discrete Math."},{"issue":"1","key":"567_CR18","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/18.651000","volume":"44","author":"EM Rains","year":"1998","unstructured":"Rains, E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inf. Theory 44(1), 134\u2013139 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"567_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ffa.2018.08.011","volume":"54","author":"M Shi","year":"2018","unstructured":"Shi, M., Sok, L., Sol\u00e9, P., Calkavur, S.: Self-dual codes and orthogonal matrices over large finite fields. Finite Fields Appl. 54, 297\u2013314 (2018)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"567_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0097-3165(89)90030-7","volume":"52","author":"VD Tonchev","year":"1989","unstructured":"Tonchev, V.D.: Self-orthogonal designs and extremal doubly even codes. J. Comb. Theory Ser. A 52(2), 197\u2013205 (1989)","journal-title":"J. Comb. Theory Ser. A"},{"key":"567_CR21","volume-title":"A Course in Combinatorics","author":"JH van Lint","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00567-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-022-00567-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00567-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T02:06:33Z","timestamp":1727575593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-022-00567-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,13]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s00200-022-00567-2","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2022,7,13]]},"assertion":[{"value":"17 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}