{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:44:16Z","timestamp":1761061456151},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transfun.2021tap0010","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T22:09:47Z","timestamp":1627596587000},"page":"381-388","source":"Crossref","is-referenced-by-count":1,"title":["Linking Reversed and Dual Codes of Quasi-Cyclic Codes"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Ramy","family":"TAKI ELDIN","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Ain Shams University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajime","family":"MATSUI","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] N. Aboluion, D.H. Smith, and S. Perkins, \u201cLinear and nonlinear constructions of DNA codes with Hamming distance <i>d<\/i>, constant <i>GC<\/i>-content and a reverse-complement constraint,\u201d Discrete Math., vol.312, no.5, pp.1062-1075, March 2012. 10.1016\/j.disc.2011.11.021","DOI":"10.1016\/j.disc.2011.11.021"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] H. Hong, L. Wang, H. Ahmad, J. Li, Y. Yang, and C. Wu, \u201cConstruction of DNA codes by using algebraic number theory,\u201d Finite Fields Th. App., vol.37, pp.328-343, Jan. 2016. 10.1016\/j.ffa.2015.10.008","DOI":"10.1016\/j.ffa.2015.10.008"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] R. Taki ElDin and H. Matsui, \u201cRun-length constraint of cyclic reverse-complement and constant GC-content DNA codes,\u201d IEICE Trans. Fundamental, vol.E103-A, no.1, pp.325-333, Jan. 2020. 10.1587\/transfun.2019eap1053","DOI":"10.1587\/transfun.2019EAP1053"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. Bennenni, K. Guenda, and S. Mesnager, \u201cDNA cyclic codes over rings,\u201d Advances in Mathematics of Communications (AMC), vol.11, no.1, pp.83-98, Feb. 2017. 10.3934\/amc.2017004","DOI":"10.3934\/amc.2017004"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] P. Gaborit and O.D. King, \u201cLinear constructions for DNA codes,\u201d Theor. Comput. Sci., vol.334, no.1-3, pp.99-113, April 2005. 10.1016\/j.tcs.2004.11.004","DOI":"10.1016\/j.tcs.2004.11.004"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Kim, C. Kim, and J. No, \u201cOverview of binary locally repairable codes for distributed storage systems,\u201d Electronics, vol.8, no.6, 596, May 2019. 10.3390\/electronics8060596","DOI":"10.3390\/electronics8060596"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] H.J. Kim, W.-H. Choi, and Y. Lee, \u201cDesigning DNA codes from reversible self-dual codes over <i>GF<\/i>(4),\u201d Discrete Math., vol.344, no.1, 112159, Jan. 2021. 10.1016\/j.disc.2020.112159","DOI":"10.1016\/j.disc.2020.112159"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R. Taki ElDin and H. Matsui, \u201cQuasi-cyclic codes via unfolded cyclic codes and their reversibility,\u201d IEEE Access, vol.7, pp.184500-184508, Dec. 2019. 10.1109\/access.2019.2960569","DOI":"10.1109\/ACCESS.2019.2960569"},{"key":"9","unstructured":"[9] R. Taki ElDin and H. Matsui, \u201cGenerator polynomial matrices of reversed and reversible quasi-cyclic codes,\u201d International Symposium on Information Theory and its Applications (ISITA2020), pp.165-169, Oct. 2020."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] J.L. Massey, \u201cReversible codes,\u201d Information and Control, vol.7, no.3, pp.369-380, Sept. 1964. 10.1016\/s0019-9958(64)90438-3","DOI":"10.1016\/S0019-9958(64)90438-3"},{"key":"11","unstructured":"[11] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. 10.1016\/s0924-6509(08)x7030-8"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S. Ling and P. Sole, \u201cGood self-dual quasi-cyclic codes exist,\u201d IEEE Trans. Inf. Theory, vol.49, no.4, pp.1052-1053, April 2003. 10.1109\/tit.2003.809501","DOI":"10.1109\/TIT.2003.809501"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] C. Mart\u00ednez-P\u00e9rez and W. Willems, \u201cSelf-dual doubly even 2-quasi-cyclic transitive codes are asymptotically good,\u201d IEEE Trans. Inf. Theory, vol.53, no.11, pp.4302-4308, Nov. 2007. 10.1109\/tit.2007.907500","DOI":"10.1109\/TIT.2007.907500"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] H. Matsui, \u201cOn generator and parity-check polynomial matrices of generalized quasi-cyclic codes,\u201d Finite. Fields. Th. App., vol.34, pp.280-304, July 2015. 10.1016\/j.ffa.2015.02.003","DOI":"10.1016\/j.ffa.2015.02.003"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] R. Taki ElDin and H. Matsui, \u201cOn reversibility and self-duality for some classes of quasi-cyclic codes,\u201d IEEE Access, vol.8, pp.143285-143293, Aug. 2020. 10.1109\/access.2020.3013958","DOI":"10.1109\/ACCESS.2020.3013958"},{"key":"16","unstructured":"[16] M. Grassl, \u201cBounds on the minimum distance of linear codes and quantum codes,\u201d online available at http:\/\/www.codetables.de\/ accessed on Feb. 19, 2021."}],"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\/E105.A\/3\/E105.A_2021TAP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T03:21:05Z","timestamp":1646450465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/3\/E105.A_2021TAP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021tap0010","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021TAP0010"}}