{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T04:45:20Z","timestamp":1774673120691,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T00:00:00Z","timestamp":1433289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10623-015-0100-8","type":"journal-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T23:23:43Z","timestamp":1433287423000},"page":"379-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Codes over $$F_{4}+vF_4$$ F 4 + v F 4 and some DNA applications"],"prefix":"10.1007","volume":"80","author":[{"given":"Aysegul","family":"Bayram","sequence":"first","affiliation":[]},{"given":"Elif Segah","family":"Oztas","sequence":"additional","affiliation":[]},{"given":"Irfan","family":"Siap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"key":"100_CR1","unstructured":"Abualrub T., Aydin N., Seneviratne P.: Theta-cyclic codes cver $$F_2 + vF_2$$ F 2 + v F 2 . Aust. J. Comb. 54, 115\u2013126 (2012)."},{"key":"100_CR2","doi-asserted-by":"crossref","unstructured":"Adleman L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021\u20131024 (1994).","DOI":"10.1126\/science.7973651"},{"key":"100_CR3","doi-asserted-by":"crossref","unstructured":"Bayram A., Siap I.: Structure of codes over the ring $$Z_{3}[v]\/\\langle v^{3}-v\\rangle $$ Z 3 [ v ] \/ \u27e8 v 3 - v \u27e9 . Appl. Algebra Eng. Commun. Comput. 24, 369\u2013386 (2013).","DOI":"10.1007\/s00200-013-0208-x"},{"key":"100_CR4","doi-asserted-by":"crossref","unstructured":"Bayram A., Siap I.: Cyclic and constacyclic codes over a non-chain ring. J. Algebra Comb. Discret. Struct. Appl. 1, 1\u201313 (2014).","DOI":"10.13069\/jacodesmath.31486"},{"key":"100_CR5","doi-asserted-by":"crossref","unstructured":"Bayram A., Oztas E.S., Siap I.: Codes over a non chain ring with some applications. Lecture Notes in Computer Science, vol. 8592, pp. 106\u2013110 (2014).","DOI":"10.1007\/978-3-662-44199-2_18"},{"key":"100_CR6","doi-asserted-by":"crossref","unstructured":"Boucher D., Geiselmann W., Ulmer F.: Skew cyclic codes. Appl. Algebr. Eng. Commun. 18, 379\u2013389 (2007)","DOI":"10.1007\/s00200-007-0043-z"},{"key":"100_CR7","doi-asserted-by":"crossref","unstructured":"Boucher D., Sole P., Ulmer F.: Skew constacyclic codes over galois rings. Adv. Math. Commun. 2, 273\u2013292 (2008).","DOI":"10.3934\/amc.2008.2.273"},{"key":"100_CR8","doi-asserted-by":"crossref","unstructured":"Gursoy F., Siap I., Yildiz B.: Construction of skew cylic codes over $$F_{q} + vF_{q}$$ F q + v F q . Adv. Math. Commun. 8, 313\u2013322 (2014).","DOI":"10.3934\/amc.2014.8.313"},{"key":"100_CR9","doi-asserted-by":"crossref","unstructured":"Hammons A.R., Kumar Jr. P.V., Calderbank J.A., Sloane N.J.A., Sole P.: The $$Z_4$$ Z 4 -linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301\u2013319 (1994).","DOI":"10.1109\/18.312154"},{"key":"100_CR10","unstructured":"Horimoto H., Shiromoto K.: MDS codes over finite quasi-Frobenius rings, preprint."},{"key":"100_CR11","doi-asserted-by":"crossref","unstructured":"Jitman S., Ling S., Udomkavanich P.: Skew constacyclic codes over finite chain rings. Adv. Math. Commun. 6, 39\u201363 (2012).","DOI":"10.3934\/amc.2012.6.39"},{"key":"100_CR12","doi-asserted-by":"crossref","unstructured":"Marathe A., Condon A.N., Corn R.M.: On combinatorial DNA word design. J. Comput. Biol. 8, 201\u2013219 (2001).","DOI":"10.1089\/10665270152530818"},{"key":"100_CR13","doi-asserted-by":"crossref","unstructured":"Massey J.L.: Reversible codes. Inf. Control 7, 369\u2013380 (1964).","DOI":"10.1016\/S0019-9958(64)90438-3"},{"key":"100_CR14","doi-asserted-by":"crossref","unstructured":"Oztas E.S., Siap I.: Lifted polynomials over $$F_{16}$$ F 16 and their applications to DNA codes. Filomat 27, 459\u2013466 (2013).","DOI":"10.2298\/FIL1303459O"},{"key":"100_CR15","doi-asserted-by":"crossref","unstructured":"Shiromoto K., Storme L.: A Griesmer bound for linear codes over finite quasi-Frobenius rings. Discret. Appl. Math. 128, 263274 (2003).","DOI":"10.1016\/S0166-218X(02)00450-X"},{"key":"100_CR16","doi-asserted-by":"crossref","unstructured":"Siap I., Abualrub T., Aydin N., Seneviratne P.: Skew cyclic codes of arbitrary length. Int. J. Inf. Coding Theory 2, 10\u201320 (2011).","DOI":"10.1504\/IJICOT.2011.044674"},{"key":"100_CR17","doi-asserted-by":"crossref","unstructured":"Siap I., Abualrub T., Ghrayeb A.: Cyclic DNA codes over the ring $$F_2[u]\/(u^2-1)$$ F 2 [ u ] \/ ( u 2 - 1 ) based on the deletion distance. J. Franklin Ins. 346, 731\u2013740 (2006).","DOI":"10.1016\/j.jfranklin.2009.07.002"},{"key":"100_CR18","doi-asserted-by":"crossref","unstructured":"Abualrub T., Ghrayeb A., Zeng X.N.: Consruction of cyclic codes over $$F_4$$ F 4 for DNA computing. J. Franklin Ins. 343, 448\u2013457 (2006).","DOI":"10.1016\/j.jfranklin.2006.02.009"},{"key":"100_CR19","unstructured":"Xu X.Q., Zhu S.X.: Skew cyclic codes over the ring $$F_4+vF_4$$ F 4 + v F 4 . J. Hefei Univ. Technol. Nat. Sci. 34, 1429\u20131432 (2011)."},{"key":"100_CR20","doi-asserted-by":"crossref","unstructured":"Yamamoto M., Kashiwamura S., Ohuchi A.: DNA memory with $$16.8$$ 16.8 M addresses. Lecture Notes in Computer Science, DNA Computing, vol. 4868, pp. 99\u2013108 (2008).","DOI":"10.1007\/978-3-540-77962-9_10"},{"key":"100_CR21","doi-asserted-by":"crossref","unstructured":"Yildiz B., Karadeniz S.: Linear codes over $$F_{2} + uF_{2} +vF_{2} + uvF_{2}$$ F 2 + u F 2 + v F 2 + u v F 2 . Des. Codes Cryptogr. 54, 61\u201381 (2010).","DOI":"10.1007\/s10623-009-9309-8"},{"key":"100_CR22","doi-asserted-by":"crossref","unstructured":"Yildiz B., Siap I.: Cyclic codes over $$F_2[u]\/(u^4 - 1)$$ F 2 [ u ] \/ ( u 4 - 1 ) and applications to DNA codes. Comput. Math. Appl. 63, 1169\u20131176 (2012).","DOI":"10.1016\/j.camwa.2011.12.029"},{"key":"100_CR23","doi-asserted-by":"crossref","unstructured":"Zhu S., Wang Y.: A class of constacyclic codes over $$F_{p}+vF_{p}$$ F p + v F p and their Gray image. Discret. Math. Theory 311, 2677\u20132682 (2011).","DOI":"10.1016\/j.disc.2011.08.015"},{"key":"100_CR24","doi-asserted-by":"crossref","unstructured":"Zhu S., Wang Y., Shi M.: Some result on cyclic codes over $$F_{2}+vF_{2}$$ F 2 + v F 2 . IEEE Trans. Inf. Theory 56, 1680\u20131684 (2010).","DOI":"10.1109\/TIT.2010.2040896"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0100-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0100-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0100-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T21:03:25Z","timestamp":1566767005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0100-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["100"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0100-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,3]]}}}