{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:49Z","timestamp":1740122509248,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1210061"],"award-info":[{"award-number":["DMS-1210061"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["422479"],"award-info":[{"award-number":["422479"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10623-018-0469-2","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T12:02:13Z","timestamp":1519387333000},"page":"2661-2676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lexicodes over finite principal ideal rings"],"prefix":"10.1007","volume":"86","author":[{"given":"Jared","family":"Antrobus","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2780-192X","authenticated-orcid":false,"given":"Heide","family":"Gluesing-Luerssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"469_CR1","unstructured":"Bennenni N., Guenda K., Gulliver T.A.: Greedy construction of DNA codes and new bounds. Preprint 2015. \n                    arXiv: 1505.06262\n                    \n                   (2015)."},{"key":"469_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0097-3165(93)90085-M","volume":"64","author":"R Brualdi","year":"1993","unstructured":"Brualdi R., Pless V.: Greedy codes. J. Combin. Theory Ser. A 64, 10\u201330 (1993).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"469_CR3","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1006\/jabr.1995.1255","volume":"176","author":"M Canfell","year":"1995","unstructured":"Canfell M.: Completion of diagrams by automorphisms and Bass\u2019 first stable range condition. J. Algebra 176(2), 480\u2013503 (1995).","journal-title":"J. Algebra"},{"key":"469_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1986.1057187","volume":"32","author":"J Conway","year":"1986","unstructured":"Conway J., Sloane N.: Lexicographic codes: error-correcting codes from game theory. IEEE Trans. Inf. Theory 32, 337\u2013348 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"469_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/jcta.1999.3033","volume":"92","author":"M Greferath","year":"2000","unstructured":"Greferath M., Schmidt S.E.: Finite ring combinatorics and MacWilliams\u2019 Equivalence Theorem. J. Combin. Theory Ser. A 92, 17\u201328 (2000).","journal-title":"J. Combin. Theory Ser. A"},{"key":"469_CR6","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s10623-012-9791-2","volume":"72","author":"K Guenda","year":"2014","unstructured":"Guenda K., Gulliver T., Sheikholeslam S.: Lexicodes over rings. Des. Codes Cryptogr. 72, 749\u2013763 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"469_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/PL00000451","volume":"76","author":"T Honold","year":"2001","unstructured":"Honold T.: Characterization of finite Frobenius rings. Arch. Math. 76, 406\u2013415 (2001).","journal-title":"Arch. Math."},{"key":"469_CR8","doi-asserted-by":"crossref","unstructured":"Honold T., Landjev I.: Linear codes over finite chain rings. Electron. J. Combin. 7, Research Paper 11, 22 pp (2000)","DOI":"10.37236\/1489"},{"key":"469_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-56755-1_21","volume-title":"Proceedings of the Fifth International Conference on Finite Fields and Applications Fq5 (Augsburg, 1999)","author":"T Honold","year":"2001","unstructured":"Honold T., Landjev I.: MacWilliams identities for linear codes over finite Frobenius rings. In: Jungnickel D., Niederreiter H. (eds.) Proceedings of the Fifth International Conference on Finite Fields and Applications Fq5 (Augsburg, 1999), pp. 276\u2013292. Springer, Berlin (2001)."},{"key":"469_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"key":"469_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8616-0","volume-title":"A First Course in Noncommutative Rings","author":"T. Y. Lam","year":"2001","unstructured":"Lam T.Y.: A First Course in Noncommutative Rings. Graduate Text in Mathematics, 2nd edn, vol. 131. Springer, New York (2001)."},{"issue":"03","key":"469_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1142\/S0219498804000897","volume":"3","author":"TY Lam","year":"2004","unstructured":"Lam T.Y.: A crash course on stable range, cancellation, substitution and exchange. J. Algebra Appl. 3(03), 301\u2013343 (2004).","journal-title":"J. Algebra Appl."},{"key":"469_CR13","unstructured":"Levenstein V.I.: A class of systematic codes. Dokl. Akad. Nauk SSSR 131(5), 1011\u20131014. In Russian: Translated in Soviet Math. Dokl. 1, 368\u2013371 (1960)."},{"key":"469_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/11779360_9","volume-title":"Coding and Cryptography","author":"Olgica Milenkovic","year":"2006","unstructured":"Milenkovic O., Kashyap N.: On the design of codes for DNA computing. In Coding and Cryptography, pp. 100\u2013119. Springer, Berlin (2006)."},{"key":"469_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1070\/SM1973v020n03ABEH001880","volume":"20","author":"AA Nechaev","year":"1973","unstructured":"Nechaev A.A.: Finite principal ideal rings. Math. USSR Sbornik 20, 364\u2013382 (1973).","journal-title":"Math. USSR Sbornik"},{"key":"469_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"R\u00a0P Stanley","year":"1997","unstructured":"Stanley R\u00a0.P.: Enumerative Combinatorics, vol. I. Cambridge University Press, Cambridge (1997)."},{"key":"469_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1008244404559","volume":"10","author":"AJ Van Zanten","year":"1997","unstructured":"Van Zanten A.J.: Lexicographic order and linearity. Des. Codes Cryptogr. 10, 85\u201397 (1997).","journal-title":"Des. Codes Cryptogr."},{"key":"469_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10623-004-3802-x","volume":"37","author":"AJ Van Zanten","year":"2005","unstructured":"Van Zanten A.J., Suparta I.N.: On the construction of linear $$q$$-ary lexicodes. Des. Codes Cryptogr. 37, 15\u201329 (2005).","journal-title":"Des. Codes Cryptogr."},{"key":"469_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1353\/ajm.1999.0024","volume":"121","author":"JA Wood","year":"1999","unstructured":"Wood J.A.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555\u2013575 (1999).","journal-title":"Am. J. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0469-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0469-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0469-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:37:17Z","timestamp":1589722637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0469-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0469-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"20 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}