{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T17:53:10Z","timestamp":1719251590470},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:00:00Z","timestamp":1613952000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:00:00Z","timestamp":1613952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00200-021-00495-7","type":"journal-article","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T17:04:38Z","timestamp":1614013478000},"page":"345-358","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A note on the construction and enumeration of Euclidean self-dual skew-cyclic codes"],"prefix":"10.1007","volume":"32","author":[{"family":"Irwansyah","sequence":"first","affiliation":[]},{"given":"Intan","family":"Muchtadi-Alamsyah","sequence":"additional","affiliation":[]},{"given":"Ahmad","family":"Muchlis","sequence":"additional","affiliation":[]},{"given":"Aleams","family":"Barra","sequence":"additional","affiliation":[]},{"given":"Djoko","family":"Suprijanto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"issue":"4","key":"495_CR1","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1109\/TIT.2010.2092415","volume":"57","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Ling, S., Xing, C.: On self-dual cyclic codes over finite fields. IEEE Trans. Inf. Theory 57(4), 2243\u20132251 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"495_CR2","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.jsc.2007.11.008","volume":"44","author":"D Boucher","year":"2009","unstructured":"Boucher, D., Ulmer, F.: Coding with skew polynomial rings. J. Symb. Comput. 44, 1644\u20131656 (2009)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"495_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00200-007-0043-z","volume":"18","author":"D Boucher","year":"2007","unstructured":"Boucher, D., Geiselmann, W., Ulmer, F.: Skew-cyclic codes. Appl. Algebra Eng. Commun. Comput. 18(4), 379\u2013389 (2007)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"495_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-18681-8_18","volume":"9084","author":"D Boucher","year":"2015","unstructured":"Boucher, D.: A note on the existence of self-dual skew codes over finite fields. Lecture Notes in Computer Science, Proccedings in Honour of Thierry Berger 9084, 228\u2013239 (2015)","journal-title":"Lecture Notes in Computer Science, Proccedings in Honour of Thierry Berger"},{"key":"495_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jsc.2013.10.003","volume":"60","author":"D Boucher","year":"2013","unstructured":"Boucher, D., Ulmer, F.: Self-dual skew-codes and factorization of skew-polynomials. J. Symb. Comput. 60, 47\u201361 (2013)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"495_CR6","doi-asserted-by":"publisher","first-page":"765","DOI":"10.3934\/amc.2016040","volume":"10","author":"D Boucher","year":"2016","unstructured":"Boucher, D.: Construction and number of self-dual skew codes over $${\\mathbb{F}}_{p^{2}}$$. Adv. Math. Commun. 10(4), 765\u2013795 (2016)","journal-title":"Adv. Math. Commun."},{"issue":"1\u20132","key":"495_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12190-017-1095-2","volume":"57","author":"Irwansyah","year":"2018","unstructured":"Irwansyah, Barra, A., Muchtadi-Alamsyah, I., Muchlis, A., Suprijanto, D.: Skew-cyclic codes over $$B_k$$. J. Appl. Math. Comput. 57(1\u20132), 69\u201384 (2018)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"495_CR8","first-page":"10","volume":"2","author":"I Siap","year":"2011","unstructured":"Siap, I., Abualrub, T., Aydin, N., Seneviratne, P.: Skew-cyclic codes of arbitrary length. Int. J. Inf. Coding Theory 2(1), 10\u201320 (2011)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"495_CR9","unstructured":"Consorte, O.D., Valdez, L.D.: On Euclidean and Hermitian self-dual cyclic codes over $${\\mathbb{F}}_{2^{r}}$$. Philipp. J. Sci. (2016)"},{"key":"495_CR10","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de. Accessed on 11 Nov 2020"},{"key":"495_CR11","unstructured":"Harada, M., Munemasa, A.: Database of self-dual codes. Online available at http:\/\/www.math.is.tohoku.ac.jp\/~munemasa\/selfdualcodes.htm. Accessed on 11 Nov 2020"},{"key":"495_CR12","unstructured":"Gaborit, P., Otmani, A.: Tables of self-dual codes. Online available at http:\/\/www.unilim.fr\/pages_perso\/philippe.gaborit\/SD\/. Accessed on 11 Nov 2020"}],"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-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-021-00495-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-021-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T12:04:28Z","timestamp":1621857868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-021-00495-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,22]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1007\/s00200-021-00495-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,22]]},"assertion":[{"value":"28 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}