{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:48:38Z","timestamp":1770061718241,"version":"3.49.0"},"reference-count":14,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.3934\/amc.2024053","type":"journal-article","created":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T01:35:07Z","timestamp":1733448907000},"page":"1260-1276","source":"Crossref","is-referenced-by-count":1,"title":["Several infinite families of binary cyclic codes with square-root-like lower bounds"],"prefix":"10.3934","volume":"19","author":[{"given":"Xiuyu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hefei University of Technology, Hefei, 230601, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2024053-1","unstructured":"<p>E. F. Assmus and J. D. Key, Polynomial codes and finite geometries, in <i>Handbook of Coding Theory<\/i> (eds. V.S. Pless and W.C. Huffman), Elsevier, Amsterdam, (1998), 1269-1343.<\/p>"},{"key":"key-10.3934\/amc.2024053-2","unstructured":"<p>P. Charpin, Open problems on cyclic codes, in <i>Handbook of Coding Theory<\/i> (eds. V.S. Pless and W.C. Huffman), Elsevier, Amsterdam, <b>1<\/b> (1971), 963-1063.<\/p>"},{"key":"key-10.3934\/amc.2024053-3","unstructured":"<p>M. Grassl, <i>Bounds on the Minimum Distance of Linear Codes and Quantum Codes<\/i>, Online available at <ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"http:\/\/www.codetables.de\">http:\/\/www.codetables.de<\/ext-link>.<\/p>"},{"key":"key-10.3934\/amc.2024053-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102270"},{"key":"key-10.3934\/amc.2024053-5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01285-7"},{"key":"key-10.3934\/amc.2024053-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-6509(08)70532-4"},{"key":"key-10.3934\/amc.2024053-7","doi-asserted-by":"crossref","unstructured":"<p>V. S. Pless and W. C. Huffman, Duadic codes, in <i>Fundamentals of Error-Correcting Codes<\/i> (eds. V.S. Pless and W.C. Huffman), Cambridge University Press, (2003), 209-251.<\/p>","DOI":"10.1017\/CBO9780511807077.007"},{"key":"key-10.3934\/amc.2024053-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102200"},{"key":"key-10.3934\/amc.2024053-9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3193715"},{"key":"key-10.3934\/amc.2024053-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102308"},{"key":"key-10.3934\/amc.2024053-11","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"key-10.3934\/amc.2024053-12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2829763"},{"key":"key-10.3934\/amc.2024053-13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066008"},{"key":"key-10.3934\/amc.2024053-14","doi-asserted-by":"publisher","DOI":"10.1109\/18.887870"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T09:36:27Z","timestamp":1745228187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2024053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2024053","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}