{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:43:40Z","timestamp":1761061420027},"reference-count":6,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1587\/transfun.2021eal2021","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T22:33:55Z","timestamp":1621550035000},"page":"1649-1653","source":"Crossref","is-referenced-by-count":3,"title":["A Modulus Factorization Algorithm for Self-Orthogonal and Self-Dual Quasi-Cyclic Codes via Polynomial Matrices"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Hajime","family":"MATSUI","sequence":"first","affiliation":[{"name":"Toyota Technological Institute"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] W.C. Huffman, \u201cOn the classification and enumeration of self-dual codes,\u201d Finite Fields and Their Applications, vol.11, no.3, pp.451-490, Aug. 2005. 10.1016\/j.ffa.2005.05.012","DOI":"10.1016\/j.ffa.2005.05.012"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Grassl, \u201cSearching for linear codes with large minimum distance,\u201d Discovering Mathematics with Magma \u2014 Reducing the Abstract to the Concrete, W. Bosma and J. Cannon, eds., pp.287-313, Springer, Heidelberg, 2006. 10.1007\/978-3-540-37634-7_13","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] H. Matsui, \u201cOn generator and parity-check polynomial matrices of generalized quasi-cyclic codes,\u201d Finite Fields and Their Applications, vol.34, pp.280-304, July 2015. 10.1016\/j.ffa.2015.02.003","DOI":"10.1016\/j.ffa.2015.02.003"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] H. Matsui, \u201cMultiplicative structure and Hecke rings of generator matrices for codes over quotient rings of Euclidean domains,\u201d MDPI Mathematics, vol.5, no.4, 82, doi: 10.3390\/math5040082, Dec. 2017. 10.3390\/math5040082","DOI":"10.3390\/math5040082"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] H. Matsui, \u201cA modulus factorization algorithm for self-orthogonal and self-dual integer codes,\u201d IEICE Trans. Fundamentals, vol.E101-A, no.11, pp.1952-1956, Nov. 2018. 10.1587\/transfun.e101.a.1952","DOI":"10.1587\/transfun.E101.A.1952"},{"key":"6","unstructured":"[6] H. Matsui, \u201cA modulus factorization algorithm for self-orthogonal and self-dual quasi-cyclic codes,\u201d The 42nd Symposium on Information Theory and its Applications (SITA2019), pp.273-276, Kirishima, Kagoshima, Japan, Nov. 2019."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/11\/E104.A_2021EAL2021\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T03:19:57Z","timestamp":1636168797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/11\/E104.A_2021EAL2021\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":6,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021eal2021","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,1]]},"article-number":"2021EAL2021"}}