{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:33:34Z","timestamp":1753439614843},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T00:00:00Z","timestamp":1616025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T00:00:00Z","timestamp":1616025600000},"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":[[2023,3]]},"DOI":"10.1007\/s00200-021-00502-x","type":"journal-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:19:13Z","timestamp":1616113153000},"page":"267-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constacyclic duadic codes over $${\\mathbb {F}}_4$$"],"prefix":"10.1007","volume":"34","author":[{"given":"Arezoo Soufi","family":"Karbaski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Samei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tayebeh","family":"Sepahvand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,18]]},"reference":[{"key":"502_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ffa.2008.05.004","volume":"14","author":"T Blackford","year":"2008","unstructured":"Blackford, T.: Negacyclic duadic codes. Finite Fields Appl. 14, 930\u2013943 (2008)","journal-title":"Finite Fields Appl."},{"key":"502_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ffa.2013.05.005","volume":"24","author":"T Blackford","year":"2013","unstructured":"Blackford, T.: Isodual constacyclic codes. Finite Fields Appl. 24, 29\u201344 (2013)","journal-title":"Finite Fields Appl."},{"key":"502_CR3","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10623-016-0282-8","volume":"84","author":"Y Fan","year":"2017","unstructured":"Fan, Y., Zhang, L.: Galois self-dual constacyclic codes. Des. Codes Cryptogr. 84, 473\u2013492 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"502_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-009-9267-1","volume":"52","author":"M Grassl","year":"2009","unstructured":"Grassl, M., Gulliver, T.A.: On circulant self-dual codes over small fields. Des. Codes Cryptogr. 52, 57\u201381 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"502_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error Correcting Codes. Cambrigde University Press, Cambrigde (2003)"},{"key":"502_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.ffa.2005.05.012","volume":"11","author":"WC Huffman","year":"2005","unstructured":"Huffman, W.C.: On the classification and enumeration of self-dual codes. Finite Fields Appl. 11, 451\u2013490 (2005)","journal-title":"Finite Fields Appl."},{"key":"502_CR7","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TIT.1984.1056944","volume":"30","author":"JS Leon","year":"1984","unstructured":"Leon, J.S., Masley, J.M., Pless, V.: Duadic codes. IEEE Trans. Inf. Theory 30, 709\u2013714 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"502_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10623-013-9865-9","volume":"74","author":"Y Yang","year":"2011","unstructured":"Yang, Y., Cai, W.: On self-dual constacyclic codes over finite fields. Des. Codes Cryptogr. 74, 355\u2013364 (2011)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-021-00502-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-021-00502-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-021-00502-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T20:58:23Z","timestamp":1677013103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-021-00502-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,18]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["502"],"URL":"https:\/\/doi.org\/10.1007\/s00200-021-00502-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,18]]},"assertion":[{"value":"4 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}