{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:24Z","timestamp":1740122484392,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T00:00:00Z","timestamp":1702166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T00:00:00Z","timestamp":1702166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["22-41-04411"],"award-info":[{"award-number":["22-41-04411"]}],"id":[{"id":"10.13039\/501100006769","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":[[2024,5]]},"DOI":"10.1007\/s10623-023-01333-2","type":"journal-article","created":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T09:02:07Z","timestamp":1702198927000},"page":"1127-1142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction-D lattice from Garcia\u2013Stichtenoth tower code"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8924-7605","authenticated-orcid":false,"given":"Elena","family":"Kirshanova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0977-5999","authenticated-orcid":false,"given":"Ekaterina","family":"Malygina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,10]]},"reference":[{"key":"1333_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.4153\/CJM-1983-008-1","volume":"1","author":"ES Barnes","year":"1983","unstructured":"Barnes E.S., Sloane N.J.A.: New lattice packings of spheres. Can. J. Math. 1, 117\u2013130 (1983).","journal-title":"Can. J. Math."},{"issue":"1","key":"1333_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1017\/S1446788700025064","volume":"1","author":"ES Barnes","year":"1959","unstructured":"Barnes E.S., Wall G.E.: Some extreme forms defined in terms of abelian groups. J. Aust. Math. Soc. 1(1), 47\u201363 (1959).","journal-title":"J. Aust. Math. Soc."},{"key":"1333_CR3","unstructured":"Bennett H., Peikert C.: Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes (2022). arXiv:2202.07736."},{"issue":"5","key":"1333_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","volume":"21","author":"P Delsarte","year":"1975","unstructured":"Delsarte P.: On subfield subcodes of modified Reed-Solomon codes (corresp.). IEEE Trans. Inf. Theory 21(5), 575\u2013576 (1975).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1333_CR5","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1007\/s10623-018-0573-3","volume":"87","author":"L Ducas","year":"2019","unstructured":"Ducas L., Pierrot C.: Polynomial time bounded distance decoding near Minkowski\u2019s bound in discrete logarithm lattices. Des. Codes Cryptogr. 87(8), 1737\u20131748 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1333_CR6","doi-asserted-by":"crossref","unstructured":"Gao S., Shokrollahi M.A.: Computing roots of polynomials over function fields of curves. In: Coding Theory and Cryptography, pp. 214\u2013228 (2000).","DOI":"10.1007\/978-3-642-59663-6_12"},{"issue":"2","key":"1333_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia A., Stichtenoth H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Number Theory 61(2), 248\u2013273 (1996).","journal-title":"J. Number Theory"},{"key":"1333_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-016-0151-x","volume":"26","author":"E Grigorescu","year":"2017","unstructured":"Grigorescu E., Peikert C.: List-decoding Barnes-Wall lattices. IEEE Conf. Comput. Complex. 26, 365\u2013392 (2017).","journal-title":"IEEE Conf. Comput. Complex."},{"key":"1333_CR9","doi-asserted-by":"crossref","unstructured":"Guruswami V., Sudan M.: Improved decoding of Reed-Solomon and algebraic-geometric codes. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp. 28\u201337 (1998).","DOI":"10.1109\/SFCS.1998.743426"},{"issue":"2","key":"1333_CR10","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/3506668","volume":"69","author":"V Guruswami","year":"2022","unstructured":"Guruswami V., Xing C.: Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. J. ACM 69(2), 10:1-10:48 (2022).","journal-title":"J. ACM"},{"issue":"11","key":"1333_CR11","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","volume":"49","author":"R Koetter","year":"2003","unstructured":"Koetter R., Vardy A.: Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 49(11), 2809\u20132825 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1333_CR12","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/TIT.2021.3126540","volume":"68","author":"E Mook","year":"2022","unstructured":"Mook E., Peikert C.: Lattice (list) decoding near Minkowski\u2019s inequality. IEEE Trans. Inf. Theory 68(2), 863\u2013870 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1333_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C.: A decade of lattice cryptography. Found Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016).","journal-title":"Found Trends Theor. Comput. Sci."},{"key":"1333_CR14","doi-asserted-by":"crossref","unstructured":"Shokrollahi M.A., Wasserman H.: Decoding algebraic-geometric codes beyond the error-correction bound. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC \u201998, pp. 241\u2013248 (1998).","DOI":"10.1145\/276698.276753"},{"issue":"6","key":"1333_CR15","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K Shum","year":"2001","unstructured":"Shum K., Aleshnikov I., Kumar P., et al.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47(6), 2225\u20132241 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1333_CR16","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2008","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, 2nd edn Springer, Berlin (2008).","edition":"2"},{"issue":"2","key":"1333_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2140\/moscow.2019.8.163","volume":"8","author":"S Vl\u0103du\u0163","year":"2019","unstructured":"Vl\u0103du\u0163 S.: Lattices with exponentially large kissing numbers. Mosc. J. Comb. Number Theory 8(2), 163\u2013177 (2019).","journal-title":"Mosc. J. Comb. Number Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01333-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01333-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01333-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T18:08:54Z","timestamp":1730830134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01333-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,10]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1333"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01333-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,12,10]]},"assertion":[{"value":"10 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}