{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:46:39Z","timestamp":1774626399323,"version":"3.50.1"},"reference-count":20,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016003","type":"journal-article","created":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T17:06:13Z","timestamp":1462208773000},"page":"229-254","source":"Crossref","is-referenced-by-count":5,"title":["On the ideal associated to a linear code"],"prefix":"10.3934","volume":"10","author":[{"given":"Irene","family":"M\u00e1rquez-Corbella","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Su\u00e1rez-Canedo","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016003-1","doi-asserted-by":"crossref","unstructured":"M. Aliasgari, M. R. Sadeghi and D. Panario, Gr\u00f6bner Bases for Lattices and an Algebraic Decoding Algorithm, <em>IEEE Trans. Commun.<\/em>, <strong>61<\/strong> (2013), 1222-1230.","DOI":"10.1109\/TCOMM.2013.13.120317"},{"key":"key-10.3934\/amc.2016003-2","doi-asserted-by":"publisher","unstructured":"A. Ashikhmin and A. Barg, Minimal vectors in linear codes, <em>IEEE Trans. Inf. Theory<\/em>, <strong>44<\/strong> (1998), 2010-2017.","DOI":"10.1109\/18.705584"},{"key":"key-10.3934\/amc.2016003-3","unstructured":"A. Barg, Complexity issues in coding theory, in <em>Handbook of Coding Theory<\/em>, North-Holland, Amsterdam, 1998, 649-754."},{"key":"key-10.3934\/amc.2016003-4","doi-asserted-by":"crossref","unstructured":"E. R. Berlekamp, R. J. McEliece and H. C. A. Van Tilborg, On the inherent intractability of certain coding problems, <em>IEEE Trans. Inf. Theory<\/em>, <strong>IT-24<\/strong> (1978), 384-386.","DOI":"10.1109\/TIT.1978.1055873"},{"key":"key-10.3934\/amc.2016003-5","doi-asserted-by":"publisher","unstructured":"M. Borges-Quintana, M. A. Borges-Trenard, P. Fitzpatrick and E. Mart\u00ednez-Moro, Gr\u00f6bner bases and combinatorics for binary codes, <em>Appl. Algebra Engrg. Comm. Comput.<\/em>, <strong>19<\/strong> (2008), 393-411.","DOI":"10.1007\/s00200-008-0080-2"},{"key":"key-10.3934\/amc.2016003-6","doi-asserted-by":"crossref","unstructured":"M. Borges-Quintana, M. A. Borges-Trenard, I. M\u00e1rquez-Corbella and E. Mart\u00ednez-Moro, An algebraic view to gradient descent decoding, in <em>IEEE Inf. Theory Workshop (ITW)<\/em>, 2010, 1-4.","DOI":"10.1109\/CIG.2010.5592830"},{"key":"key-10.3934\/amc.2016003-7","doi-asserted-by":"publisher","unstructured":"J. Bruck and M. Naor, The hardness of decoding linear codes with preprocessing, <em>IEEE Trans. Inf. Theory<\/em>, <strong>36<\/strong> (1990), 381-385.","DOI":"10.1109\/18.52484"},{"key":"key-10.3934\/amc.2016003-8","doi-asserted-by":"publisher","unstructured":"D. A. Cox, J. Little and D. O'Shea, <em>Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra<\/em>, Springer, 2007.","DOI":"10.1007\/978-0-387-35651-8"},{"key":"key-10.3934\/amc.2016003-9","doi-asserted-by":"crossref","unstructured":"F. Di Biase and R. Urbanke, An algorithm to calculate the kernel of certain polynomial ring homomorphisms, <em>Exper. Math.<\/em>, <strong>4<\/strong> (1995), 227-234.","DOI":"10.1080\/10586458.1995.10504323"},{"key":"key-10.3934\/amc.2016003-10","doi-asserted-by":"publisher","unstructured":"D. Eisenbud and B. Sturmfels, Binomial ideals, <em>Duke Math. J.<\/em>, <strong>84<\/strong> (1996), 1-45.","DOI":"10.1215\/S0012-7094-96-08401-X"},{"key":"key-10.3934\/amc.2016003-11","doi-asserted-by":"publisher","unstructured":"<em>J. Symbolic Comput.<\/em>, <strong>16<\/strong> (193), 329-344.","DOI":"10.1006\/jsco.1993.1051"},{"key":"key-10.3934\/amc.2016003-12","doi-asserted-by":"publisher","unstructured":"P. Fitzpatrick, Solving a multivariable congruence by change of term order, <em>J. Symb. Comput.<\/em>, <strong>24<\/strong> (1997), 575-589.","DOI":"10.1006\/jsco.1997.0153"},{"key":"key-10.3934\/amc.2016003-13","doi-asserted-by":"publisher","unstructured":"P. Fitzpatrick and J. Flynn, A Gr\u00f6bner basis technique for Pad\u00e9 approximation, <em>J. Symb. Comput.<\/em>, <strong>13<\/strong> (1992), 133-138.","DOI":"10.1016\/S0747-7171(08)80087-9"},{"key":"key-10.3934\/amc.2016003-14","unstructured":"D. Ikegami and Y. Kaji, Maximum likelihood decoding for linear block codes using Grobner bases, <em>IEICE Trans. Fund. Electron. Commun. Comput. Sci.<\/em>, <strong>E86-A<\/strong> (2003), 643-651."},{"key":"key-10.3934\/amc.2016003-15","doi-asserted-by":"publisher","unstructured":"R. A. Liebler, Implementing gradient descent decoding, <em>Michigan Math. J.<\/em>, <strong>58<\/strong> (2009), 285-291.","DOI":"10.1307\/mmj\/1242071693"},{"key":"key-10.3934\/amc.2016003-16","doi-asserted-by":"publisher","unstructured":"I. M\u00e1rquez-Corbella and E. Mart\u00ednez-Moro, Algebraic structure of the minimal support codewords set of some linear codes, <em>Adv. Math. Commun.<\/em>, <strong>5<\/strong> (2011), 233-244.","DOI":"10.3934\/amc.2011.5.233"},{"key":"key-10.3934\/amc.2016003-17","doi-asserted-by":"publisher","unstructured":"I. M\u00e1rquez-Corbella and E. Mart\u00ednez-Moro, Decomposition of modular codes for computing test sets and Graver basis, <em>Math. Comp. Sci.<\/em>, <strong>6<\/strong> (2012), 147-165.","DOI":"10.1007\/s11786-012-0120-y"},{"key":"key-10.3934\/amc.2016003-18","doi-asserted-by":"crossref","unstructured":"E. Prange, Step-by-step decoding in groups with weight function. Part 1, <em>Air Force Cambridge Res. Labs Hanscom AFB MA<\/em>, 1961.","DOI":"10.21236\/AD0268032"},{"key":"key-10.3934\/amc.2016003-19","unstructured":"P. Samuel, <em>Algebraic Theory of Numbers: Translated from the French by Allan J. Silberger<\/em>, Dover, 2013."},{"key":"key-10.3934\/amc.2016003-20","doi-asserted-by":"crossref","unstructured":"B. Sturmfels, <em>Gr\u00f6bner Bases and Convex Polytopes<\/em>, Amer. Math. Soc., Providence, 1996.","DOI":"10.1090\/ulect\/008"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:23Z","timestamp":1772791523000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016003","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}