{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:14:45Z","timestamp":1777295685379,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"vor","delay-in-days":6,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2022-138906NB-C21"],"award-info":[{"award-number":["PID2022-138906NB-C21"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2401558"],"award-info":[{"award-number":["DMS-2401558"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100023561","name":"Ministerio de Universidades","doi-asserted-by":"publisher","award":["FPU20\/01311"],"award-info":[{"award-number":["FPU20\/01311"]}],"id":[{"id":"10.13039\/501100023561","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007515","name":"Universidad de Valladolid","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007515","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Multivariate multiplicity codes have been recently explored because of their importance for list decoding and local decoding. Given a multivariate multiplicity code, in this paper, we compute its dimension using Gr\u00f6bner basis tools, its dual in terms of indicator functions, and explicitly describe a parity-check matrix. In contrast with Reed\u2013Muller, Reed\u2013Solomon, univariate multiplicity, and other evaluation codes, the dual of a multivariate multiplicity code is not equivalent or isometric to a multiplicity code (i.e., this code family is not closed under duality). We use our explicit description to provide a lower bound on the minimum distance for the dual of a multiplicity code.<\/jats:p>","DOI":"10.1007\/s10623-026-01812-2","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T12:01:05Z","timestamp":1775563265000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Duals of multiplicity codes"],"prefix":"10.1007","volume":"94","author":[{"given":"Eduardo Camps","family":"Moreno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e1n","family":"Fidalgo-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiram H.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Ruano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"San-Jos\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"issue":"1\u20132","key":"1812_CR1","first-page":"1","volume":"20","author":"E Abbe","year":"2023","unstructured":"Abbe E., Sberlo O., Shpilka A., Ye M.: Reed-Muller codes. Found. Trends\u00ae Commun. Inf. Theor. 20(1\u20132), 1\u2013156 (2023).","journal-title":"Found. Trends\u00ae Commun. Inf. Theor."},{"issue":"2","key":"1812_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.4171\/aihpd\/160","volume":"10","author":"S Ball","year":"2023","unstructured":"Ball S., Centelles A., Huber F.: Quantum error-correcting codes and their geometries. Ann. Inst. Henri Poincar\u00e9 D 10(2), 337\u2013405 (2023).","journal-title":"Ann. Inst. Henri Poincar\u00e9 D"},{"key":"1812_CR3","doi-asserted-by":"publisher","DOI":"10.2140\/jsag.2021.11.113","author":"T Ball","year":"2021","unstructured":"Ball T., Camps E., Chimal-Dzul H., Jaramillo-Velez D., L\u00f3pez H.H., Nichols N., Perkins M., Soprunov I., Vera-Mart\u00ednez G., Whieldon G.: Coding theory package for Macaulay2. J. Softw. Algebra Geom. (2021). https:\/\/doi.org\/10.2140\/jsag.2021.11.113.","journal-title":"J. Softw. Algebra Geom."},{"key":"1812_CR4","doi-asserted-by":"crossref","unstructured":"Bhandari S., Harsha P., Kumar M., Sudan M.: Decoding multivariate multiplicity codes on product sets. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pp. 1489\u20131501, New York (2021).","DOI":"10.1145\/3406325.3451027"},{"issue":"2","key":"1812_CR5","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TIT.2023.3345890","volume":"70","author":"S Bhandari","year":"2024","unstructured":"Bhandari S., Harsha P., Kumar M., Sudan M.: Ideal-theoretic explanation of capacity-achieving decoding. IEEE Trans. Info. Theory 70(2), 1107\u20131123 (2024).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1812_CR6","doi-asserted-by":"crossref","unstructured":"Bhandari S., Harsha P., Kumar M., Shankar A.: Algorithmizing the multiplicity Schwartz-Zippel lemma. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2816\u20132835. SIAM, Philadelphia (2023).","DOI":"10.1137\/1.9781611977554.ch106"},{"issue":"3","key":"1812_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma Algebra System I: the user language. J. Symb. Comput. 24(3), 235\u2013265 (1997).","journal-title":"J. Symb. Comput."},{"key":"1812_CR8","doi-asserted-by":"crossref","unstructured":"Chen H., Cramer R., Goldwasser S., De\u00a0Haan R., Vaikuntanathan V.: Secure computation from random error correcting codes. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 291\u2013310. Springer (2007).","DOI":"10.1007\/978-3-540-72540-4_17"},{"key":"1812_CR9","doi-asserted-by":"crossref","unstructured":"Chen Y., Zhang Z.: Explicit folded Reed\u2013Solomon and multiplicity codes achieve relaxed generalized singleton bounds. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC \u201925, pp. 1\u201312, New York (2025).","DOI":"10.1145\/3717823.3718114"},{"key":"1812_CR10","volume-title":"Undergraduate Texts in Mathematics","author":"DA Cox","year":"2015","unstructured":"Cox D.A., Little J., O\u2019Shea D.: Undergraduate Texts in Mathematics, 4th edn Springer, Cham (2015).","edition":"4"},{"key":"1812_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0019-9958(70)90214-7","volume":"16","author":"P Delsarte","year":"1970","unstructured":"Delsarte P., Goethals J.-M., MacWilliams F.J.: On generalized Reed-Muller codes and their relatives. Inf. Control 16, 403\u2013442 (1970).","journal-title":"Inf. Control"},{"issue":"3","key":"1812_CR12","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/18.256518","volume":"39","author":"IM Duursma","year":"1993","unstructured":"Duursma I.M.: Majority coset decoding. IEEE Trans. Info. Theory 39(3), 1067\u20131070 (1993).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"6","key":"1812_CR13","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1137\/100783704","volume":"42","author":"Z Dvir","year":"2013","unstructured":"Dvir Z., Kopparty S., Saraf S., Sudan M.: Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. SIAM J. Comput. 42(6), 2305\u20132328 (2013).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1812_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/18.179340","volume":"39","author":"GL Feng","year":"1993","unstructured":"Feng G.L., Rao T.R.N.: Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Info. Theory 39(1), 37\u201345 (1993).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"2","key":"1812_CR15","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/18.825832","volume":"46","author":"O Geil","year":"2000","unstructured":"Geil O., H\u00f8holdt T.: Footprints or generalized Bezout\u2019s theorem. IEEE Trans. Info. Theory 46(2), 635\u2013641 (2000).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"2","key":"1812_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1017\/S0963548318000342","volume":"28","author":"O Geil","year":"2019","unstructured":"Geil O., Mart\u00ednez-Pe\u00f1as U.: Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives. Combin. Probab. Comput. 28(2), 253\u2013279 (2019).","journal-title":"Combin. Probab. Comput."},{"key":"1812_CR17","unstructured":"Grayson D. R., Stillman M. E.: Macaulay2, A Software System for Research in Algebraic Geometry"},{"issue":"1","key":"1812_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TIT.2007.911222","volume":"54","author":"V Guruswami","year":"2008","unstructured":"Guruswami V., Rudra A.: Explicit codes achieving list decoding capacity: error-correction with optimal redundancy. IEEE Trans. Info. Theory 54(1), 135\u2013150 (2008).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1812_CR19","doi-asserted-by":"crossref","unstructured":"Guruswami V., Sahai A., Sudan M.: \u201cSoft-decision\u201d decoding of Chinese remainder codes. In: 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, pp. 159\u2013168. CA, 2000). IEEE Comput. Soc. Press, Los Alamitos, CA (2000).","DOI":"10.1109\/SFCS.2000.892076"},{"issue":"6","key":"1812_CR20","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1109\/TIT.2013.2246813","volume":"59","author":"V Guruswami","year":"2013","unstructured":"Guruswami V., Wang C.: Linear-algebraic list decoding for variants of Reed-Solomon codes. IEEE Trans. Info. Theory 59(6), 3257\u20133268 (2013).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1812_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1515\/crll.1936.175.50","volume":"175","author":"H Hasse","year":"1936","unstructured":"Hasse H.: Theorie der h\u00f6heren Differentiale in einem algebraischen Funktionenk\u00f6rper mit vollkommenem Konstantenk\u00f6rper bei beliebiger Charakteristik. J. f\u00fcr die reine und angewandte Mathematik 175, 50\u201354 (1936).","journal-title":"J. f\u00fcr die reine und angewandte Mathematik"},{"key":"1812_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"key":"1812_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"IT\u201314","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: New generalizations of the Reed-Muller codes. I. Primitive codes. IEEE Trans. Info. Theory IT\u201314, 189\u2013199 (1968).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"11","key":"1812_CR24","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2006","unstructured":"Ketkar A., Klappenecker A., Kumar S., Sarvepalli P.K.: Nonbinary stabilizer codes over finite fields. IEEE Trans. Info. Theory 52(11), 4892\u20134914 (2006).","journal-title":"IEEE Trans. Info. Theory"},{"issue":"5","key":"1812_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.4086\/toc.2015.v011a005","volume":"11","author":"S Kopparty","year":"2015","unstructured":"Kopparty S.: List-decoding multiplicity codes. Theor. Comput. 11(5), 149\u2013182 (2015).","journal-title":"Theor. Comput."},{"issue":"3","key":"1812_CR26","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/20M1370215","volume":"52","author":"S Kopparty","year":"2023","unstructured":"Kopparty S., Ron-Zewi N., Saraf S., Wootters M.: Improved list decoding of folded Reed-Solomon and multiplicity codes. SIAM J. Comput. 52(3), 794\u2013840 (2023).","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1812_CR27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/2629416","volume":"61","author":"S Kopparty","year":"2014","unstructured":"Kopparty S., Saraf S., Yekhanin S.: High-rate codes with sublinear-time decoding. J. ACM 61(5), 28 (2014).","journal-title":"J. ACM"},{"issue":"8","key":"1812_CR28","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1007\/s10623-020-00726-x","volume":"88","author":"HH L\u00f3pez","year":"2020","unstructured":"L\u00f3pez H.H., Matthews G.L., Soprunov I.: Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes. Des. Codes Cryptogr. 88(8), 1673\u20131685 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1812_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10623-012-9714-2","volume":"71","author":"HH L\u00f3pez","year":"2014","unstructured":"L\u00f3pez H.H., Renter\u00eda-M\u00e1rquez C., Villarreal R.H.: Affine Cartesian codes. Des. Codes Crypto 71(1), 5\u201319 (2014).","journal-title":"Des. Codes Crypto"},{"issue":"7","key":"1812_CR30","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s10623-021-00872-w","volume":"89","author":"HH L\u00f3pez","year":"2021","unstructured":"L\u00f3pez H.H., Soprunov I., Villarreal R.H.: The dual of an evaluation code. Des. Codes Crypto 89(7), 1367\u20131403 (2021).","journal-title":"Des. Codes Crypto"},{"key":"1812_CR31","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1007\/s10623-020-00772-5","volume":"88","author":"U Mart\u00ednez-Pe\u00f1as","year":"2020","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Hamming and simplex codes for the sum-rank metric. Des. Codes Crypto 88, 1521\u20131539 (2020).","journal-title":"Des. Codes Crypto"},{"key":"1812_CR32","volume-title":"Codes Cryptology and Curves with Computer Algebra","author":"R Pellikaan","year":"2018","unstructured":"Pellikaan R., Wu X.-W., Bulygin S., Jurrius R.: Codes Cryptology and Curves with Computer Algebra. Cambridge University Press, Cambridge (2018)."},{"key":"1812_CR33","unstructured":"Ron-Zewi N., Venkitesh S., Wootters M.: Efficient List-Decoding of Polynomial Ideal Codes with Optimal List Size. https:\/\/arxiv.org\/html\/2401.14517v1 (2024)."},{"issue":"6","key":"1812_CR34","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1109\/18.476240","volume":"41","author":"S Sakata","year":"1995","unstructured":"Sakata S., Justesen J., Madelung Y., Jensen H.E., H\u00f8holdt T.: Fast decoding of algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Info. Theory 41(6), 1672\u20131677 (1995).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1812_CR35","doi-asserted-by":"crossref","unstructured":"Srivastava S.: Improved list size for folded Reed-Solomon codes. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2040\u20132050. SIAM, Philadelphia (2025).","DOI":"10.1137\/1.9781611978322.64"},{"key":"1812_CR36","unstructured":"Venkitesh S.: Polynomials, divided differences, and codes. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), vol. 325 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 93:1\u201393:25 (2025)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01812-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01812-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01812-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:15:21Z","timestamp":1777292121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01812-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1812"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01812-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"22 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"81"}}