{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:02:50Z","timestamp":1768348970818,"version":"3.49.0"},"reference-count":0,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2024]]},"DOI":"10.3934\/amc.2022027","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T13:52:56Z","timestamp":1649771576000},"page":"828-841","source":"Crossref","is-referenced-by-count":5,"title":["Some constructions of (almost) optimally extendable linear codes"],"prefix":"10.3934","volume":"18","author":[{"given":"Xiaoshan","family":"Quan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, 211100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqin","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Cyberspace, Hangzhou Dianzi University, Hangzhou, 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T08:58:31Z","timestamp":1711961911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2022027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2022027","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}