{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:35:21Z","timestamp":1760524521297},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T00:00:00Z","timestamp":1690588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T00:00:00Z","timestamp":1690588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11786-023-00566-7","type":"journal-article","created":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T02:01:37Z","timestamp":1690596097000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Calculating the Minimum Distance of a Toric Code via Algebraic Algorithms"],"prefix":"10.1007","volume":"17","author":[{"given":"Fadime","family":"Baldemir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mesut","family":"\u015eahin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,29]]},"reference":[{"key":"566_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00513-8","author":"E Baran","year":"2023","unstructured":"Baran, E., Sahin, M.: On parameterized Toric codes. Appl. Algebra Eng. Commun. Comput. (2023). https:\/\/doi.org\/10.1007\/s00200-021-00513-8","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"566_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jsc.2022.09.002","volume":"116","author":"S Birmpilis","year":"2023","unstructured":"Birmpilis, S., Labahn, G., Storjohann, A.: A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. J. Symbolic Comput. 116, 146\u2013182 (2023). https:\/\/doi.org\/10.1016\/j.jsc.2022.09.002","journal-title":"J. Symbolic Comput."},{"key":"566_CR3","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-1-4471-4829-6","volume-title":"Algebraic Geometry and Commutative Algebra, Universitext","author":"S Bosch","year":"2013","unstructured":"Bosch, S.: Algebraic Geometry and Commutative Algebra, Universitext, p. 504. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-4829-6"},{"key":"566_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1112\/S1461157013000041","volume":"16","author":"G Brown","year":"2013","unstructured":"Brown, G., Kasprzyk, A.M.: Seven new champion linear codes. LMS J. Comput. Math. 16, 109\u2013117 (2013). https:\/\/doi.org\/10.1112\/S1461157013000041","journal-title":"LMS J. Comput. Math."},{"key":"566_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jsc.2012.07.001","volume":"51","author":"G Brown","year":"2013","unstructured":"Brown, G., Kasprzyk, A.M.: Small polygons and Toric codes. J. Symb. Comput. 51, 55\u201362 (2013). https:\/\/doi.org\/10.1016\/j.jsc.2012.07.001","journal-title":"J. Symb. Comput."},{"key":"566_CR6","doi-asserted-by":"publisher","unstructured":"Cox, D.A., Little, J.B., Schenck, H.K.: Toric Varieties. Graduate Studies in Mathematics, vol. 124, p. 841. American Mathematical Society, Providence, RI (2011). https:\/\/doi.org\/10.1090\/gsm\/124","DOI":"10.1090\/gsm\/124"},{"key":"566_CR7","unstructured":"Grayson, D.R., Stillman, M.E.: Macaulay2, a software system for research in algebraic geometry. Available at http:\/\/www.math.uiuc.edu\/Macaulay2\/"},{"key":"566_CR8","doi-asserted-by":"publisher","unstructured":"Hansen, J.P.: Secret sharing schemes with strong multiplication and a large number of players from toric varieties. In: Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 686, pp. 171\u2013185 (2017). https:\/\/doi.org\/10.1090\/conm\/686\/13783","DOI":"10.1090\/conm\/686\/13783"},{"key":"566_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, J.P.: Toric surfaces, linear and quantum codes secret sharing and decoding. Facets of Algebraic Geometry: Volume 1: A Collection in Honor of William Fulton\u2019s 80th Birthday 472, 371 (2022)","DOI":"10.1017\/9781108877831.013"},{"issue":"2","key":"566_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(90)90155-B","volume":"81","author":"G Lachaud","year":"1990","unstructured":"Lachaud, G.: The parameters of projective Reed-Muller codes. Discrete Math. 81(2), 217\u2013221 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90155-B","journal-title":"Discrete Math."},{"key":"566_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2013.05.004","volume":"24","author":"JB Little","year":"2013","unstructured":"Little, J.B.: Remarks on generalized Toric codes. Finite Fields Appl. 24, 1\u201314 (2013). https:\/\/doi.org\/10.1016\/j.ffa.2013.05.004","journal-title":"Finite Fields Appl."},{"issue":"1","key":"566_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1090\/S1056-3911-04-00385-6","volume":"14","author":"D Maclagan","year":"2005","unstructured":"Maclagan, D., Smith, G.: Uniform bounds on multigraded regularity. J. Algebr. Geom 14(1), 137\u2013164 (2005). https:\/\/doi.org\/10.1090\/S1056-3911-04-00385-6","journal-title":"J. Algebr. Geom"},{"issue":"2","key":"566_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.jpaa.2016.06.006","volume":"221","author":"J Martinez-Bernal","year":"2017","unstructured":"Martinez-Bernal, J., Pitones, Y., Villarreal, R.H.: Minimum distance functions of graded ideals and reed-muller-type codes. J. Pure Appl. Algebra 221(2), 251\u2013275 (2017). https:\/\/doi.org\/10.1016\/j.jpaa.2016.06.006","journal-title":"J. Pure Appl. Algebra"},{"issue":"01","key":"566_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1142\/S1793042122500142","volume":"18","author":"J Nardi","year":"2022","unstructured":"Nardi, J.: Projective Toric codes. Int. J. Number Theory 18(01), 179\u2013204 (2022). https:\/\/doi.org\/10.1142\/S1793042122500142","journal-title":"Int. J. Number Theory"},{"key":"566_CR15","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.jalgebra.2019.06.022","volume":"535","author":"J Nardi","year":"2019","unstructured":"Nardi, J.: Algebraic geometric codes on minimal Hirzebruch surfaces. J. Algebra 535, 556\u2013597 (2019). https:\/\/doi.org\/10.1016\/j.jalgebra.2019.06.022","journal-title":"J. Algebra"},{"key":"566_CR16","unstructured":"\u015eahin, M.: Computing vanishing ideals for Toric codes. arXiv preprint arXiv:2207.01061 (2022)"},{"key":"566_CR17","doi-asserted-by":"crossref","unstructured":"\u015eahin, M., Yayla, O.: Codes on subgroups of weighted projective tori. arXiv preprint arXiv:2210.07550 (2022)","DOI":"10.1007\/s10623-023-01337-y"},{"key":"566_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ffa.2018.04.007","volume":"52","author":"M \u015eahin","year":"2018","unstructured":"\u015eahin, M.: Toric codes and lattice ideals. Finite Fields Appl. 52, 243\u2013260 (2018). https:\/\/doi.org\/10.1016\/j.ffa.2018.04.007","journal-title":"Finite Fields Appl."},{"key":"566_CR19","doi-asserted-by":"publisher","unstructured":"\u015eahin, M.: In: Barucci, V., Chapman, S., D\u2019Anna, M., Fr\u00f6berg, R. (eds.) Lattice Ideals, Semigroups and Toric Codes, pp. 285\u2013302. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40822-0_16","DOI":"10.1007\/978-3-030-40822-0_16"},{"key":"566_CR20","unstructured":"Smith, G.G.: NormalToricVarieties: A Macaulay2 package. Version\u00a01.9. A Macaulay2 package available at https:\/\/github.com\/Macaulay2\/M2\/blob\/master\/M2\/Macaulay2\/packages\/NormalToricVarieties.m2"},{"key":"566_CR21","unstructured":"Stillman, M., Yackel, C., Chen, J., Sayrafi, M.: PrimaryDecomposition: A Macaulay2 package. Version\u00a02.0. A Macaulay2 package available at https:\/\/faculty.math.illinois.edu\/Macaulay2\/doc\/Macaulay2-1.21\/share\/doc\/Macaulay2\/PrimaryDecomposition\/html\/index.html"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-023-00566-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-023-00566-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-023-00566-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T13:36:35Z","timestamp":1702388195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-023-00566-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,29]]},"references-count":21,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s11786-023-00566-7","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,29]]},"assertion":[{"value":"16 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"20"}}