{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T02:10:08Z","timestamp":1750990208477,"version":"3.41.0"},"reference-count":44,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.3934\/amc.2025011","type":"journal-article","created":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T09:34:01Z","timestamp":1742549641000},"page":"1605-1625","source":"Crossref","is-referenced-by-count":0,"title":["Linear codes over &lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;$ \\mathbb{Z}_{p^2} $&lt;\/tex-math&gt;&lt;\/inline-formula&gt; with few-weight from down-sets"],"prefix":"10.3934","volume":"19","author":[{"given":"Jinjiao","family":"Xu","sequence":"first","affiliation":[]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[{"name":"The Key Laboratory of Intelligent Computing Signal Processing, Ministry of Education, School of Mathematical Sciences, Anhui University, Hefei, Anhui, 230601, China"}]},{"given":"Liqin","family":"Qian","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Anhui University, Hefei, Anhui, 230601, China"}]},{"given":"Xiaoxiao","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematical Science, Peking University, Beijing, 100871, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2025011-1"},{"key":"key-10.3934\/amc.2025011-2","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"key-10.3934\/amc.2025011-3","unstructured":"<p>A. E. Brouwer, Bounds on linear codes, in: V. S. Pless and W. C. Huffman(Eds.), <i>Handbook of Coding Theory<\/i>, Elsevier, Amsterdam, The Netherlands, <b>1<\/b> (1998), 295-461.<\/p>"},{"key":"key-10.3934\/amc.2025011-4","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"key-10.3934\/amc.2025011-5","doi-asserted-by":"publisher","DOI":"10.1109\/18.681328"},{"key":"key-10.3934\/amc.2025011-6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847722"},{"key":"key-10.3934\/amc.2025011-7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0442-5"},{"key":"key-10.3934\/amc.2025011-8","unstructured":"<p>B. Chen, Y. Xu, Z. Hu, N. Li and X. Zeng, Optimal linear codes with few weights from simplicial complexes, to appear, <i>IEEE Trans. Inform. Theory<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2025011-9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"key-10.3934\/amc.2025011-10"},{"key":"key-10.3934\/amc.2025011-11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2420118"},{"key":"key-10.3934\/amc.2025011-12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896872"},{"key":"key-10.3934\/amc.2025011-13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896886"},{"key":"key-10.3934\/amc.2025011-14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_2"},{"key":"key-10.3934\/amc.2025011-15","unstructured":"<p>M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Available from: <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.2025011-16","doi-asserted-by":"publisher","DOI":"10.1109\/18.796395"},{"key":"key-10.3934\/amc.2025011-17","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1999.3033"},{"key":"key-10.3934\/amc.2025011-18","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"key-10.3934\/amc.2025011-19","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"key-10.3934\/amc.2025011-20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2455032"},{"key":"key-10.3934\/amc.2025011-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2015.12.002"},{"key":"key-10.3934\/amc.2025011-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.007"},{"key":"key-10.3934\/amc.2025011-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00793-0"},{"key":"key-10.3934\/amc.2025011-24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2993179"},{"key":"key-10.3934\/amc.2025011-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.01.009"},{"key":"key-10.3934\/amc.2025011-26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3317064"},{"key":"key-10.3934\/amc.2025011-27","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-017-0277-y"},{"key":"key-10.3934\/amc.2025011-28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891562"},{"key":"key-10.3934\/amc.2025011-29"},{"key":"key-10.3934\/amc.2025011-30"},{"key":"key-10.3934\/amc.2025011-31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2742499"},{"key":"key-10.3934\/amc.2025011-32","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-021-02430-6"},{"key":"key-10.3934\/amc.2025011-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.10.027"},{"key":"key-10.3934\/amc.2025011-34","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2614934"},{"key":"key-10.3934\/amc.2025011-35","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.050"},{"key":"key-10.3934\/amc.2025011-36","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-017-0345-8"},{"key":"key-10.3934\/amc.2025011-37","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-016-0206-5"},{"key":"key-10.3934\/amc.2025011-38","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004223"},{"key":"key-10.3934\/amc.2025011-39","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.01.019"},{"key":"key-10.3934\/amc.2025011-40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3358332"},{"key":"key-10.3934\/amc.2025011-41","unstructured":"<p>Y. Wu, T. Pang, N. Li, Y. Pan and X. Zeng, Infinite families of optimal and minimal codes over rings using simplicial complexes, preprint, 2024, arXiv: 2407.09783.<\/p>"},{"key":"key-10.3934\/amc.2025011-42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946840"},{"key":"key-10.3934\/amc.2025011-43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860412"},{"key":"key-10.3934\/amc.2025011-44","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2950401"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T01:35:21Z","timestamp":1750988121000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2025011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2025011","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"type":"print","value":"1930-5346"},{"type":"electronic","value":"1930-5338"}],"subject":[],"published":{"date-parts":[[2025]]}}}