{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:07Z","timestamp":1772283607120,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11786-012-0120-y","type":"journal-article","created":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T06:25:25Z","timestamp":1341642325000},"page":"147-165","source":"Crossref","is-referenced-by-count":1,"title":["Decomposition of Modular Codes for Computing Test Sets and Graver Basis"],"prefix":"10.1007","volume":"6","author":[{"given":"Irene","family":"M\u00e1rquez-Corbella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,8]]},"reference":[{"key":"120_CR1","unstructured":"Barg, A.: Complexity issues in coding theory. In: Handbook of Coding Theory, vols. I, II, pp. 649\u2013754. North-Holland, Amsterdam (1998)"},{"issue":"3","key":"120_CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"IT-24","author":"E.R. Berlekamp","year":"1978","unstructured":"Berlekamp E.R., McEliece R.J., van Tilborg Henk C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory IT-24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"120_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00200-008-0080-2","volume":"19","author":"M. Borges-Quintana","year":"2008","unstructured":"Borges-Quintana M., Borges-Trenard M.A., Fitzpatrick P., Mart\u00ednez-Moro E.: Gr\u00f6bner bases and combinatorics for binary codes. Appl. Algebra Eng. Commun. Comput. 19(5), 393\u2013 (2008)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"120_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.A., Mart\u00ednez-Moro E.: On a Gr\u00f6bner bases structure associated to linear codes. J. Discrete Math. Sci. Cryptogr. 10(2), 151\u2013191 (2007)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"120_CR5","unstructured":"Borges-Quintana, M., Borges-Trenard, M.A., M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E.: An algebraic view to gradient descent decoding. In: Information Theory Workshop (ITW), 2010 IEEE, vol. 3, pp. 1\u20134, 30 Sept 2010"},{"issue":"2","key":"120_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/18.52484","volume":"36","author":"J. Bruck","year":"1990","unstructured":"Bruck J., Naor M.: The hardness of decoding linear codes with preprocessing. IEEE Trans. Inf. Theory. 36(2), 381\u2013385 (1990)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"120_CR7","doi-asserted-by":"crossref","unstructured":"Conti, P., Traverso, C.: Buchberger algorithm and integer programming. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (New Orleans, LA, 1991). Lecture Notes in Comput. Sci., vol. 539, pp. 130\u2013139. Springer, Berlin (1991)","DOI":"10.1007\/3-540-54522-0_102"},{"key":"120_CR8","unstructured":"Garc\u00eda-Garc\u00eda, J.I., Moreno-Fr\u00edas, M.A., Vigneron-Tenorio, A.: On glued semigroups. ArXiv:1104.2835v2 (2011)"},{"issue":"2","key":"120_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"J.E. Graver","year":"1975","unstructured":"Graver J.E.: On the foundations of linear and integer linear programming. I. Math. Programm. 9(2), 207\u2013226 (1975)","journal-title":"I. Math. Programm."},{"issue":"6","key":"120_CR10","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1979.1056120","volume":"25","author":"T.Y. Hwang","year":"1979","unstructured":"Hwang T.Y.: Decoding linear block codes for minimizing word error rate. IEEE Trans. Inf. Theory. 25(6), 733\u2013737 (1979)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"A(3","key":"120_CR11","first-page":"643","volume":"86","author":"D. Ikegami","year":"2003","unstructured":"Ikegami D., Kaji Y.: Maximum likelihood decoding for linear block codes using Grobner bases. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E 86(A(3), 643\u2013651 (2003)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci. E"},{"issue":"7","key":"120_CR12","doi-asserted-by":"crossref","first-page":"3035","DOI":"10.1109\/TIT.2008.924700","volume":"54","author":"N. Kashyap","year":"2008","unstructured":"Kashyap N.: A decomposition theory for binary linear codes. IEEE Trans. Inf. Theory. 54(7), 3035\u20133058 (2008)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"8","key":"120_CR13","doi-asserted-by":"crossref","first-page":"3501","DOI":"10.1109\/TIT.2009.2023718","volume":"55","author":"N. Kashyap","year":"2009","unstructured":"Kashyap N.: On minimal tree realizations of linear codes. IEEE Trans. Inf. Theory. 55(8), 3501\u20133519 (2009)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"120_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1307\/mmj\/1242071693","volume":"58","author":"R.A. Liebler","year":"2009","unstructured":"Liebler R.A.: Implementing gradient descent decoding. Michigan Math. J. 58(1), 285\u2013291 (2009)","journal-title":"Michigan Math. J."},{"issue":"2","key":"120_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.3934\/amc.2011.5.233","volume":"5","author":"I. M\u00e1rquez-Corbella","year":"2011","unstructured":"M\u00e1rquez-Corbella I., Mart\u00ednez-Moro E.: Algebraic structure of the minimal support codewords set of some linear codes. Adv. Math. Commun. 5(2), 233\u2013244 (2011)","journal-title":"Adv. Math. Commun."},{"key":"120_CR16","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279 (1993)"},{"issue":"2","key":"120_CR17","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/PL00005916","volume":"55","author":"J.C. Rosales","year":"1997","unstructured":"Rosales J.C.: On presentations of subsemigroups of N n . Semigroup Forum 55(2), 152\u2013159 (1997)","journal-title":"Semigroup Forum"},{"key":"120_CR18","unstructured":"Stein, W.A., et\u00a0al.:Sage Mathematics Software (Version 4.7.2). The Sage Development Team (2012). http:\/\/www.sagemath.org"},{"key":"120_CR19","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Gr\u00f6bner bases and convex polytopes. University Lecture Series, vol. 8. American Mathematical Society, Providence (1996)","DOI":"10.1090\/ulect\/008"},{"issue":"1","key":"120_CR20","first-page":"195","volume":"41","author":"A. Thoma","year":"2000","unstructured":"Thoma A.: Construction of set theoretic complete intersections via semigroup gluing. Beitr\u00e4ge Algebra Geom. 41(1), 195\u2013198 (2000)","journal-title":"Beitr\u00e4ge Algebra Geom."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-012-0120-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-012-0120-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T17:34:36Z","timestamp":1561916076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-012-0120-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s11786-012-0120-y","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}