{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:31:06Z","timestamp":1773160266468,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10623-020-00764-5","type":"journal-article","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T11:03:43Z","timestamp":1593774223000},"page":"1653-1672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["High dimensional affine codes whose square has a designed minimum distance"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4993-7577","authenticated-orcid":false,"given":"Ignacio","family":"Garc\u00eda-Marco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3428-5759","authenticated-orcid":false,"given":"Irene","family":"M\u00e1rquez-Corbella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7304-0087","authenticated-orcid":false,"given":"Diego","family":"Ruano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,3]]},"reference":[{"key":"764_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, pp. 1\u201310, NY, USA (1988).","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"764_CR2","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TIT.2018.2867873","volume":"65","author":"I Cascudo","year":"2019","unstructured":"Cascudo I.: On squares of cyclic codes. IEEE Trans. Inf. Theory 65(2), 1034\u20131047 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"764_CR3","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/TIT.2015.2393251","volume":"61","author":"I Cascudo","year":"2015","unstructured":"Cascudo I., Cramer R., Mirandola D., Z\u00e9mor G.: Squares of random linear codes. IEEE Trans. Inf. Theory 61(3), 1159\u20131173 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"764_CR4","doi-asserted-by":"publisher","first-page":"101606","DOI":"10.1016\/j.ffa.2019.101606","volume":"62","author":"I Cascudo","year":"2020","unstructured":"Cascudo I., Gundersen J.S., Ruano D.: Squares of matrix-product codes. Finite Fields Appl. 62, 101606 (2020).","journal-title":"Finite Fields Appl."},{"key":"764_CR5","doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e9peau C., Damg\u00e5rd I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, pp. 11\u201319, NY, USA (1988).","DOI":"10.1145\/62212.62214"},{"key":"764_CR6","doi-asserted-by":"crossref","unstructured":"Cramer R., Damg\u00e5rd I., Maurer U.: General secure multi-party computation from any linear secret-sharing scheme. In: Advances in cryptology EUROCRYPT 2000 (Bruges), volume 1807 of Lecture Notes in Comput. Sci., pp. 316\u2013334. Springer, Berlin (2000).","DOI":"10.1007\/3-540-45539-6_22"},{"key":"764_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer R., Damg\u00e5rd I., Nielsen J.B.: Secure Multiparty Computation and Secret Sharing, 1st edn. Cambridge University Press, New York (2015).","edition":"1"},{"key":"764_CR8","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Zakarias S.: Constant-overhead secure computation of boolean circuits using preprocessing. In: Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography, TCC\u201913, pp. 621\u2013641, Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-36594-2_35"},{"key":"764_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Nielsen J.B., Nielsen M., Ranellucci S.: The TinyTable protocol for 2-party secure computation, or: gate-scrambling revisited. In: Advances in cryptology CRYPTO 2017. Part I, volume 10401 of Lecture Notes in Comput. Sci., pp. 167\u2013187. Springer, Cham (2017).","DOI":"10.1007\/978-3-319-63688-7_6"},{"issue":"6","key":"764_CR10","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/18.476241","volume":"41","author":"G-L Feng","year":"1995","unstructured":"Feng G.-L., Rao T.R.N.: Improved geometric Goppa codes. I. Basic theory. Special issue on algebraic geometry codes. IEEE Trans. Inf. Theory 41(6), 1678\u20131693 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"764_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008274212057","volume":"13","author":"J Fitzgerald","year":"1998","unstructured":"Fitzgerald J., Lax R.F.: Decoding affine variety codes using Gr\u00f6bner bases. Des. Codes Cryptogr. 13, 147\u2013158 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"764_CR12","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1007\/s11128-015-1057-2","volume":"14","author":"C Galindo","year":"2015","unstructured":"Galindo C., Hernando F., Ruano D.: Stabilizer quantum codes from $$J$$-affine variety codes and a new Steane-like enlargement. Quantum Inf. Process. 14(9), 3211\u20133231 (2015).","journal-title":"Quantum Inf. Process."},{"key":"764_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10623-008-9211-9","volume":"48","author":"O Geil","year":"2008","unstructured":"Geil O.: On the second weight of generalized Reed-Muller codes. Des. Codes Cryptogr. 48, 323\u2013330 (2008).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"764_CR14","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. Inf. Theory 46(2), 635\u2013641 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"764_CR15","doi-asserted-by":"crossref","unstructured":"Geil O., H\u00f8holdt T.: On hyperbolic codes. Applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 2001), pp. 159\u2013171, Lecture Notes in Comput. Sci., 2227, Springer, Berlin (2001).","DOI":"10.1007\/3-540-45624-4_17"},{"issue":"11","key":"764_CR16","doi-asserted-by":"publisher","first-page":"1850204","DOI":"10.1142\/S0219498818502043","volume":"17","author":"J Mart\u00ednez-Bernal","year":"2018","unstructured":"Mart\u00ednez-Bernal J., Pitones Y., Villarreal R.H.: Minimum distance functions of complete intersections. J. Algebra Appl. 17(11), 1850204 (2018).","journal-title":"J. Algebra Appl."},{"key":"764_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0012-365X(92)90567-Y","volume":"106\u2013107","author":"R Pellikaan","year":"1992","unstructured":"Pellikaan R.: On decoding by error location and dependent sets of error positions. Discret. Math. 106\u2013107, 369\u2013381 (1992).","journal-title":"Discret. Math."},{"issue":"5","key":"764_CR18","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1109\/TIT.2013.2237944","volume":"59","author":"H Randriambololona","year":"2013","unstructured":"Randriambololona H.: Asymptotically good binary linear codes with asymptotically good self-intersection spans. IEEE Trans. Inf. Theory 59(5), 3038\u20133045 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"764_CR19","doi-asserted-by":"crossref","unstructured":"Randriambololona H.: On products and powers of linear codes under component wise multiplication. In: Algorithmic Arithmetic, Geometry and Coding Theory, volume 637 of Contemp. Math., pp. 3-78, Amer. Math. Soc., Providence, RI (2015).","DOI":"10.1090\/conm\/637\/12749"},{"issue":"6","key":"764_CR20","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1109\/18.165459","volume":"38","author":"AB S\u00f8rensen","year":"1992","unstructured":"S\u00f8rensen A.B.: Weighted Reed-Muller codes and algebraic-geometric codes. IEEE Trans. Inf. Theory 38(6), 1821\u20131826 (1992).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00764-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00764-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00764-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,2]],"date-time":"2021-07-02T23:20:26Z","timestamp":1625268026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00764-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,3]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["764"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00764-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,3]]},"assertion":[{"value":"31 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}