{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:36:28Z","timestamp":1773232588183,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T00:00:00Z","timestamp":1219104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00200-008-0080-2","type":"journal-article","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T10:23:21Z","timestamp":1219055001000},"page":"393-411","source":"Crossref","is-referenced-by-count":21,"title":["Gr\u00f6bner bases and combinatorics for binary codes"],"prefix":"10.1007","volume":"19","author":[{"given":"M.","family":"Borges-Quintana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Borges-Trenard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Fitzpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,19]]},"reference":[{"key":"80_CR1","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/003","volume-title":"An introduction to Gr\u00f6bner bases. Graduate Studies in Mathematics, 3","author":"W.W. Adams","year":"1994","unstructured":"Adams, W.W., Loustaunau, P.: An introduction to Gr\u00f6bner bases. Graduate Studies in Mathematics, 3. American Mathematical Society, Providence (1994)"},{"key":"80_CR2","unstructured":"Barg, A.: Complexity issues in coding theory. In: Handbook of Coding Theory, vol. 1. Elsevier Science, Amsterdam (1998)"},{"key":"80_CR3","doi-asserted-by":"crossref","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., Mart\u00ednez-Moro, E.: A general framework for applying FGLM techniques to linear codes. In: AAAECC 16, Lecture Notes in Computer Science, vol. 3857, pp. 76\u201386. Springer, Berlin (2006)","DOI":"10.1007\/11617983_7"},{"issue":"2","key":"80_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/09720529.2007.10698114","volume":"10","author":"M. Borges-Quintana","year":"2007","unstructured":"Borges-Quintana M., Borges-Trenard M., Mart\u00ednez-Moro E.: On a Gr\u00f6bner bases structure associated to linear codes. J. Discrete Math. Sci. Cryptography 10(2), 151\u2013191 (2007)","journal-title":"J. Discrete Math. Sci. Cryptography"},{"key":"80_CR5","first-page":"17","volume-title":"Advances in Coding Theory and Cryptography. Series on Coding Theory and Cryptology, vol. 3","author":"M. Borges-Quintana","year":"2007","unstructured":"Borges-Quintana, M., Borges-Trenard, M., Mart\u00ednez-Moro, E.: A Gr\u00f6bner bases representation for linear codes. In: Shaska et al. (eds.) Advances in Coding Theory and Cryptography. Series on Coding Theory and Cryptology, vol. 3, pp. 17\u201332. World Scientific, Singapore (2007)"},{"issue":"4","key":"80_CR6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1006\/jsco.1999.0415","volume":"30","author":"M.A. Borges-Trenard","year":"2000","unstructured":"Borges-Trenard M.A., Borges-Quintana M., Mora T.: Computing Gr\u00f6bner bases by FGLM techniques in a non-commutative setting. J. Symbolic Comput. 30(4), 429\u2013449 (2000)","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"80_CR7","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971361","volume":"126","author":"W. Brownawell","year":"1987","unstructured":"Brownawell W.: Dale Bounds for the degrees in the Nullstellensatz. Ann. Math. (2) 126(3), 577\u2013591 (1987)","journal-title":"Ann. Math. (2)"},{"key":"80_CR8","doi-asserted-by":"crossref","unstructured":"Caboara, M., Traverso, C.: Efficient algorithms for module operation. In: Proc. ISSAC\u201998, pp. 147\u2013157. ACM, New York (1998)","DOI":"10.1145\/281508.281597"},{"key":"80_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"1998","unstructured":"Cox D., Little J., O\u2019Shea D.: Using Algebraic Geometry. Springer, New York (1998)"},{"key":"80_CR10","unstructured":"Dub\u00e9, T.: Quantitative analysis problems in computer algebra: Gr\u00f6bner basis and the Nullstellensatz. Ph.D. Thesis, Courant Institute, New York University (1989)"},{"issue":"4","key":"80_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re J.C., Gianni P., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symbolic Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symbolic Comput."},{"key":"80_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0747-7171(08)80087-9","volume":"13","author":"P. Fitzpatrick","year":"1992","unstructured":"Fitzpatrick P., Flynn J.: A Gr\u00f6bner basis technique for Pad\u00e9 approximation. J. Symbolic Comput. 13, 133\u2013138 (1992)","journal-title":"J. Symbolic Comput."},{"issue":"5","key":"80_CR13","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1006\/jsco.1997.0153","volume":"24","author":"P. Fitzpatrick","year":"1997","unstructured":"Fitzpatrick P.: Solving a multivariable congruence by change of term order. J. Symbolic Comput. 24(5), 575\u2013589 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"4","key":"80_CR14","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TIT.2005.844080","volume":"51","author":"T. Helleseth","year":"2005","unstructured":"Helleseth T., Kl\u00f8ve T., Levenshtein V.I.: Error-correction capability of binary linear codes. IEEE Trans. Inform. Theory 51(4), 1408\u20131423 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"80_CR15","first-page":"643","volume":"E86-A(3)","author":"D. Ikegami","year":"2003","unstructured":"Ikegami D., Kaji Y.: Maximum likelihood decoding for linear codes using Gr\u00f6bner bases. IEICE Trans. Fundamentals Electron. Commun. Comput. Sci. E86-A(3), 643\u2013651 (2003)","journal-title":"IEICE Trans. Fundamentals Electron. Commun. Comput. Sci."},{"key":"80_CR16","doi-asserted-by":"crossref","unstructured":"Leydolda J., Stadler P.F.: Minimal Cycle Bases of Outerplanar Graphs. The electronic journal of combinatorics 5(#R16) (1998)","DOI":"10.37236\/1354"},{"key":"80_CR17","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, H.M., Mora, T.: Upper and lower bounds for the degree of Groebner basis. In: Fich, J. (ed.) EUROSAM 1984, Lecture Notes in Computer Science, vol. 174, pp. 172\u2013183. Springer, Berlin (1984)","DOI":"10.1007\/BFb0032840"},{"key":"80_CR18","doi-asserted-by":"crossref","unstructured":"Mora, T.: Solving polynomial equation systems II. Macaulay\u2019s paradigm and Gr\u00f6bner technology, Encyclopedia of Mathematics and its Applications, vol. 99. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9781107340954"},{"key":"80_CR19","volume-title":"Error-correcting Codes","author":"W.W. Peterson","year":"1972","unstructured":"Peterson W.W., Weldon E.J. Jr: Error-correcting Codes, 2nd edn. MIT Press, Cambridge (1972)","edition":"2"},{"key":"80_CR20","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Gr\u00f6bner Bases and Convex Polytopes. University Lecture Series, vol. 8. AMS, New York (1996)","DOI":"10.1090\/ulect\/008"},{"key":"80_CR21","doi-asserted-by":"crossref","unstructured":"Vismara, Ph.: Union of all the minimum cycle bases of a graph. The electronic journal of combinatorics, 4(#R9) (1997)","DOI":"10.37236\/1294"},{"key":"80_CR22","doi-asserted-by":"crossref","unstructured":"Zemor, G.: Threshold effects in codes. In: Proc. Algebraic Coding, Paris, 1993. Lecture Notes in Computer Science, vol. 781, pp. 278\u2013296. Springer, Berlin (1994)","DOI":"10.1007\/3-540-57843-9_29"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-008-0080-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0080-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:13:16Z","timestamp":1738336396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-008-0080-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,19]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s00200-008-0080-2","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,19]]}}}