{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:32:57Z","timestamp":1776720777463,"version":"3.51.2"},"reference-count":24,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3934\/amc.2017016","type":"journal-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T09:28:42Z","timestamp":1487237322000},"page":"245-258","source":"Crossref","is-referenced-by-count":21,"title":["Some results on the structure of constacyclic codes and new linear codes over &lt;i&gt;GF&lt;\/i&gt;(7) from quasi-twisted codes"],"prefix":"10.3934","volume":"11","author":[{"given":"Nuh","family":"Aydin","sequence":"first","affiliation":[]},{"given":"Nicholas","family":"Connolly","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kenyon College, Gambier, OH 43022, USA"}]},{"given":"Markus","family":"Grassl","sequence":"additional","affiliation":[{"name":"Max Planck Institute for the Science of Light, 91058 Erlangen, Germany"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2017016-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2010.11.003"},{"key":"key-10.3934\/amc.2017016-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2013.11.019"},{"key":"key-10.3934\/amc.2017016-3","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(02)00050-2"},{"key":"key-10.3934\/amc.2017016-4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011283523000"},{"key":"key-10.3934\/amc.2017016-5","doi-asserted-by":"publisher","DOI":"10.1109\/18.904549"},{"key":"key-10.3934\/amc.2017016-6","unstructured":"<p>E. R. Berlekamp, <i>Algebraic Coding Theory<\/i>, McGraw-Hill, New York, 1968.<\/p>"},{"key":"key-10.3934\/amc.2017016-7","doi-asserted-by":"publisher","DOI":"10.13069\/jacodesmath.36947"},{"key":"key-10.3934\/amc.2017016-8","doi-asserted-by":"publisher","DOI":"10.1080\/02522667.2014.961788"},{"key":"key-10.3934\/amc.2017016-9","doi-asserted-by":"publisher","DOI":"10.1109\/18.333888"},{"key":"key-10.3934\/amc.2017016-10","doi-asserted-by":"publisher","DOI":"10.1109\/18.887874"},{"key":"key-10.3934\/amc.2017016-11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819337"},{"key":"key-10.3934\/amc.2017016-12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815798"},{"key":"key-10.3934\/amc.2017016-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00126-2"},{"key":"key-10.3934\/amc.2017016-14","doi-asserted-by":"crossref","unstructured":"<p>M. Grassl, Searching for linear codes with large minimum distance, in <i>Discovering Mathematics with Magma -Reducing the Abstract to the Concrete<\/i> Springer, Heidelberg, 2006,287-313.<\/p>","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"key-10.3934\/amc.2017016-15","unstructured":"<p>M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, available at <a href=\"http:\/\/www.codetables.de\" target=\"_blank\">http:\/\/www.codetables.de<\/a>, 2007. <\/p>"},{"key":"key-10.3934\/amc.2017016-16","doi-asserted-by":"crossref","unstructured":"<p>M. Grassl and S. Han, Computing extensions of linear codes using a greedy algorithm, in <i>Proc. 2012 IEEE Int. Symp. Inf. Theory (ISIT 2012)<\/i>, Cambridge, 2012,1568-1572.<\/p>","DOI":"10.1109\/ISIT.2012.6283537"},{"key":"key-10.3934\/amc.2017016-17","doi-asserted-by":"crossref","unstructured":"<p>M. Grassl and G. White, New good linear codes by special puncturings, in <i>Proc. 2004 IEEE Int. Symp. Inf. Theory (ISIT 2004)<\/i>, Chicago, 2004,454.<\/p>","DOI":"10.1109\/ISIT.2004.1365491"},{"key":"key-10.3934\/amc.2017016-18","doi-asserted-by":"crossref","unstructured":"<p>M. Grassl and G. White, New codes from chains of quasi-cyclic codes, in <i>Proc. 2005 IEEE Int. Symp. Inf. Theory (ISIT 2005)<\/i>, Adelaide, 2005,2095-2099.<\/p>","DOI":"10.1109\/ISIT.2005.1523715"},{"key":"key-10.3934\/amc.2017016-19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00124513"},{"key":"key-10.3934\/amc.2017016-20","unstructured":"<p>F. J. MacWilliams and N. J. A. Sloane, <i>The Theory of Error-Correcting Codes<\/i>, NorthHolland, Amsterdam, 1977.<\/p>"},{"key":"key-10.3934\/amc.2017016-21","unstructured":"<p>Magma computer algebra system web site, <a href=\"http:\/\/magma.maths.usyd.edu.au\/\" target=\"_blank\">http:\/\/magma.maths.usyd.edu.au\/<\/a>. <\/p>"},{"key":"key-10.3934\/amc.2017016-22","unstructured":"<p>E. Prange, <i>Cyclic Error-Correcting Codes in Two Symbols<\/i>, Technical Report TN-57-103, Air Force Cambridge Research Center, Cambridge, 1957.<\/p>"},{"key":"key-10.3934\/amc.2017016-23","unstructured":"<p>E. Prange, <i>Some Cyclic Error-Correcting Codes with Simple Decoding Algorithm<\/i>, Technical Report TN-58-156, Air Force Cambridge Research Center, Cambridge, 1958.<\/p>"},{"key":"key-10.3934\/amc.2017016-24","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2017_1_245.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:20Z","timestamp":1772791520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2017016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2017016","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}