{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:37:40Z","timestamp":1649039860257},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T00:00:00Z","timestamp":1409702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10623-014-0008-8","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T03:34:03Z","timestamp":1409628843000},"page":"23-35","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic decoding of linear codes using commutative algebra"],"prefix":"10.1007","volume":"76","author":[{"given":"Natalia","family":"D\u00fcck","sequence":"first","affiliation":[]},{"given":"Karl-Heinz","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,3]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Adams W., Loustaunau P.: An Introduction to Gr\u00f6bner Bases. American Mathematical Society, Providence (1994).","DOI":"10.1090\/gsm\/003"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aliasgari M., Panario D., Sadeghi M.R.: Gr\u00f6bner bases for lattices and an algebraic decoding algorithm. IEEE Trans. Commun. 61(4), 1222\u20131230 (2013).","DOI":"10.1109\/TCOMM.2013.13.120317"},{"key":"8_CR3","unstructured":"Becker T., Weispfenning V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1998)."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Borges-Quintana M., Borges-Trenard M., Martinez-Moro E.: On a Gr\u00f6bner bases structure associated to linear codes. J. Discret. Math. Sci. Cryptogr. 10(2), 151\u2013191 (2007).","DOI":"10.1080\/09720529.2007.10698114"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Borges-Quintana M., Borges-Trenard M., Fitzpatrick P., Martinez-Moro E.: Gr\u00f6bner bases and combinatorics for binary codes. AAECC 19(5), 393\u2013411 (2008).","DOI":"10.1007\/s00200-008-0080-2"},{"key":"8_CR6","unstructured":"Cox D., Little J., O\u2019Shea D.: Ideals, Varieties, and Algorithms. Springer, New York (1996)."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D\u00fcck N., Zimmermann K.H.: Graver Bases and Universal Gr\u00f6bner Bases for Linear Codes. Int. J. Pure Appl. Math. (2014, to appear).","DOI":"10.12732\/ijpam.v98i4.2"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Faugere J., Gianni P., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16, 329\u2013344 (1993).","DOI":"10.1006\/jsco.1993.1051"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Huffmann W., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"8_CR10","unstructured":"Leppert R., Saleemi M., Zimmermann K.H.: Gr\u00f6bner bases for quaternary codes. J. Pure Appl. Math. 71, 595\u2013608 (2011)."},{"key":"8_CR11","unstructured":"MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes. North Holland, New York (1977)."},{"key":"8_CR12","unstructured":"Marquez-Corbella I.: Combinatorial commutative algebra approach to complete decoding. Ph.D. thesis, Institute of Mathematics, University of Valladolid (2013)."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Marquez-Corbella I., Martinez-Moro E.: Algebraic structure of the minimal support codewords set of some linear codes. Adv. Math. Commun. 5, 233\u2013244 (2011).","DOI":"10.3934\/amc.2011.5.233"},{"key":"8_CR14","unstructured":"Marquez-Corbella I., Martinez-Moro E., Suarez-Canedo E.: On the ideal associated to a linear code. Adv. Math. Commun. 5(2), 233\u2013244 (2012)."},{"key":"8_CR15","unstructured":"Saleemi M., Zimmermann K.H.: Gr\u00f6bner bases for linear codes. Int. J. Pure Appl. Math. 62, 481\u2013491 (2010)."},{"key":"8_CR16","unstructured":"Saleemi M., Zimmermann K.H.: Linear codes as binomial ideals. Int. J. Pure Appl. Math. 61, 147\u2013156 (2010)."},{"key":"8_CR17","unstructured":"Saleemi M., Zimmermann K.H.: Gr\u00f6bner bases for linear codes over GF(4). Int. J. Pure Appl. Math. 73(4), 435\u2013442 (2011)."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"van Lint J.: Introduction to Coding Theory. Springer, Berlin (1999).","DOI":"10.1007\/978-3-642-58575-3"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0008-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-0008-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0008-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T11:21:59Z","timestamp":1565781719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-0008-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["8"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-0008-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,3]]}}}