{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:35:41Z","timestamp":1761060941633},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transfun.2019eap1053","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T17:06:17Z","timestamp":1577811977000},"page":"325-333","source":"Crossref","is-referenced-by-count":6,"title":["Run-Length Constraint of Cyclic Reverse-Complement and Constant GC-Content DNA Codes"],"prefix":"10.1587","volume":"E103.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 GC-content and a reverse-complement constraint,\u201d Discrete Math., vol.312, no.5, pp.1062-1075, 2012. 10.1016\/j.disc.2011.11.021","DOI":"10.1016\/j.disc.2011.11.021"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] L.D. Baumert and R.J. McEliece, \u201cWeights of irreducible cyclic codes,\u201d Information and Control, vol.20, no.2, pp.158-175, 1972. 10.1016\/s0019-9958(72)90354-3","DOI":"10.1016\/S0019-9958(72)90354-3"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Y. Erlich and D. Zielinski, \u201cDNA fountain enables a robust and efficient storage architecture,\u201d Science, vol.355, no.6328, pp.950-954, 2017. 10.1126\/science.aaj2038","DOI":"10.1126\/science.aaj2038"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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. Appl., vol.37, pp.328-343, 2016. 10.1016\/j.ffa.2015.10.008","DOI":"10.1016\/j.ffa.2015.10.008"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] K.A.S. Immink and K. Cai, \u201cDesign of capacity-approaching constrained codes for DNA-based storage systems,\u201d IEEE Commun. Lett., vol.22, no.2, pp.224-227, 2018. 10.1109\/lcomm.2017.2775608","DOI":"10.1109\/LCOMM.2017.2775608"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] D. Limbachiya, M.K. Gupta, and V. Aggarwal, \u201cFamily of constrained codes for archival DNA data storage,\u201d IEEE Commun. Lett., vol.22, no.10, pp.1972-1975, 2018. 10.1109\/lcomm.2018.2861867","DOI":"10.1109\/LCOMM.2018.2861867"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] F.J. MacWilliams and J. Seery, \u201cThe weight distributions of some minimal cyclic codes,\u201d IEEE Trans. Inf. Theory, vol.27, no.6, pp.796-806, 1981. 10.1109\/tit.1981.1056420","DOI":"10.1109\/TIT.1981.1056420"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J.L. Massey, \u201cReversible codes,\u201d Information and Control, vol.7, no.3, pp.369-380, 1964. 10.1016\/s0019-9958(64)90438-3","DOI":"10.1016\/S0019-9958(64)90438-3"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] O. Milenkovic and N. Kashyap, \u201cOn the design of codes for DNA computing,\u201d \u00d8. Ytrehus, ed., Coding and Cryptography, Lecture Notes in Computer Science, vol.3969, pp.100-119, Springer, Berlin, Heidelberg, 2006. 10.1007\/11779360_9","DOI":"10.1007\/11779360_9"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] W. Song, K. Cai, M. Zhang, and C. Yuen, \u201cCodes with run-length and GC-content constraints for DNA-based data storage,\u201d IEEE Commun. Lett., vol.22, no.10, pp.2004-2007, 2018. 10.1109\/lcomm.2018.2866566","DOI":"10.1109\/LCOMM.2018.2866566"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Taki ElDin and H. Matsui, \u201cOn constant GC-content cyclic DNA codes with long codewords,\u201d The International Symposium on Information Theory and Its Applications (ISITA), pp.21-25, 2018. 10.23919\/isita.2018.8664300","DOI":"10.23919\/ISITA.2018.8664300"},{"key":"12","unstructured":"[12] J.H. van Lint, Introduction to Coding Theory, Springer-Verlag Berlin Heidelberg, 1999. 10.1007\/978-3-642-58575-3"},{"key":"13","unstructured":"[13] B. Yildiz and I. Siap, \u201cCyclic codes over F<sub>2<\/sub>[<i>u<\/i>]\/(<i>u<\/i><sup>4<\/sup>-1) and applications to DNA codes,\u201d Computers &amp; Mathematics with Applications, vol.63, no.7, pp.1169-1176, 2012."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] M. Zhang, K. Cai, K.A.S. Immink, and P. Chen, \u201cSoft-decision decoding for DNA-based data storage,\u201d The International Symposium on Information Theory and Its Applications (ISITA), pp.16-20, 2018. 10.23919\/isita.2018.8664305","DOI":"10.23919\/ISITA.2018.8664305"},{"key":"15","unstructured":"[15] F. Zeng, \u201cNonlinear codes: Representation, constructions, minimum distance computation and decoding,\u201d Doctoral dissertation, Universitat Aut\u00f2noma de Barcelona, 2014."}],"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\/E103.A\/1\/E103.A_2019EAP1053\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:25:46Z","timestamp":1578270346000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019EAP1053\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019eap1053","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}