{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:14:39Z","timestamp":1772147679240,"version":"3.50.1"},"reference-count":16,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.3934\/amc.2016045","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:57:08Z","timestamp":1478271428000},"page":"851-860","source":"Crossref","is-referenced-by-count":3,"title":["Computing Gr\u00f6bner bases associated with lattices"],"prefix":"10.3934","volume":"10","author":[{"given":"Ismara","family":"\u00c1lvarez-Barrientos","sequence":"first","affiliation":[]},{"given":"Mijail","family":"Borges-Quintana","sequence":"first","affiliation":[]},{"given":"Miguel Angel","family":"Borges-Trenard","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Panario","sequence":"first","affiliation":[]}],"member":"2321","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/003","article-title":"<em>An Introduction to Gr\u00f6bner Bases<\/em>,","author":"W. W. Adams","year":"1994","journal-title":"Amer. Math. Soc."},{"key":"2","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TCOMM.2013.13.120317","article-title":"Gr\u00f6bner bases for lattices and an algebraic decoding algorithm,","volume":"61","author":"M. Aliasgari","year":"2013","journal-title":"<em>IEEE Trans. Commun.<\/em>"},{"key":"3","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1109\/18.705562","article-title":"Trellis complexity and minimal trellis diagrams of lattices,","volume":"44","author":"A. H. Banihashemi","year":"1998","journal-title":"<em>IEEE Trans. Inform. Theory<\/em>"},{"key":"4","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1109\/18.910592","article-title":"Tanner graphs for group block codes and lattices: construction and complexity,","volume":"47","author":"A. H. Banihashemi","year":"2001","journal-title":"<em>IEEE Trans. Inform. Theory<\/em>"},{"key":"5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1142\/9789812772022_0002","article-title":"A Gr\u00f6bner representation for linear codes,","author":"M. Borges-Quintana","year":"2007","journal-title":"in <em>Adv. Coding Theory Crypt.<\/em>"},{"key":"6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/09720529.2007.10698114","article-title":"On a Gr\u00f6bner bases structure associated to linear codes,","volume":"10","author":"M. Borges-Quintana","year":"2007","journal-title":"<em>J. Discrete Math. Sci. Crypt.<\/em>"},{"key":"7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-008-0080-2","article-title":"On Gr\u00f6bner basis and combinatorics for binary codes,","volume":"19","author":"M. Borges-Quintana","year":"2008","journal-title":"<em>Appl. Algebra Engin. Commun. Comp.<\/em>"},{"key":"8","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jsco.1999.0415","article-title":"Computing Gr\u00f6bner bases by FGLM techniques in a non-commutative setting,","volume":"30","author":"M. A. Borges-Trenard","year":"2000","journal-title":"<em>J. Symb. Comput.<\/em>"},{"key":"9","article-title":"<em>An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-dimensional Ideal<\/em> (in German),","author":"B. Buchberger","year":"1965","journal-title":"Ph.D. thesis"},{"key":"10","first-page":"24","article-title":"The construction of multivariate polynomials with preassigned zeros,","author":"B. Buchberger","year":"1982","journal-title":"in <em>EUROCAM'82<\/em>"},{"key":"11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","article-title":"Efficient computation of zerodimensional Gr\u00f6bner bases by change of ordering,","volume":"16","author":"J. C. Faugere","year":"1993","journal-title":"<em>J. Symb. Comput.<\/em>"},{"key":"12","article-title":"<em>GAP-Groups, Algorithms, and Programming<\/em>,","author":"The GAP Group","journal-title":"available online at <a href="},{"key":"13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-89994-5_9","article-title":"Complexity of comparing monomials and two improvements of the BM-algorithm,","author":"S. Lundqvist","year":"2008","journal-title":"in <em>Math. Methods Computer Science<\/em>"},{"key":"14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3934\/amc.2011.5.233","article-title":"Algebraic structure of the minimal support codewords set of some linear codes,","volume":"5","author":"I. M\u00e1rquez-Corbella","year":"2011","journal-title":"<em>Adv. Math. Commun.<\/em>"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107340954","article-title":"<em>Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gr\u00f6bner Technology<\/em>,","author":"T. Mora","year":"2005","journal-title":"Cambridge Univ. Press"},{"key":"16","first-page":"379","article-title":"The FGLM problem and M\u00f6ller's algorithm on zero-dimensional ideals,","author":"T. Mora","year":"2009","journal-title":"in <em>Gr\u00f6bner"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=13243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:53:05Z","timestamp":1498344785000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=13243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016045","relation":{},"ISSN":["1930-5346"],"issn-type":[{"value":"1930-5346","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}