{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:03:07Z","timestamp":1742943787839,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899938"},{"type":"electronic","value":"9783540899945"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89994-5_10","type":"book-chapter","created":{"date-parts":[[2008,12,8]],"date-time":"2008-12-08T00:41:38Z","timestamp":1228696898000},"page":"126-127","source":"Crossref","is-referenced-by-count":1,"title":["Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy"],"prefix":"10.1007","author":[{"given":"Teo","family":"Mora","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Augot, D., Bardet, M., Faugere, J.C.: Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gr\u00f6bner bases. In: Proc. IEEE Int. Symp. Information Theory 2003 (2003)","key":"10_CR1","DOI":"10.1109\/ISIT.2003.1228378"},{"doi-asserted-by":"crossref","unstructured":"Augot, D., Bardet, M., Faugere, J.C.: On formulas for decoding binary cyclic codes. In: Proc. IEEE Int. Symp. Information Theory 2007 (2007)","key":"10_CR2","DOI":"10.1109\/ISIT.2007.4557618"},{"unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph. D. Thesis, Innsbruck (1965)","key":"10_CR3"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B. Buchberger","year":"1970","unstructured":"Buchberger, B.: Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems. Aeq. Math.\u00a04, 374\u2013383 (1970)","journal-title":"Aeq. Math."},{"doi-asserted-by":"crossref","unstructured":"Caboara, M.: The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gr\u00f6bner Shape Theorem. J. AAECC\u00a013 (2002)","key":"10_CR5","DOI":"10.1007\/s002000200097"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/18.333885","volume":"40","author":"X. Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Use of Gr\u00f6bner Bases to Decode Binary Cyclic Codes up to the True Minimum Distance. IEEE Trans. on Inf. Th.\u00a040, 1654\u20131661 (1994)","journal-title":"IEEE Trans. on Inf. Th."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/18.333886","volume":"40","author":"X. Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: General Principles for the Algebraic Decoding of Cyclic Codes. IEEE Trans. on Inf. Th.\u00a040, 1661\u20131663 (1994)","journal-title":"IEEE Trans. on Inf. Th."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1090\/conm\/168\/01685","volume":"168","author":"X. Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Algebraic decoding of cyclic codes: A polynomial Ideal Point of View. Contemporary Mathematics\u00a0168, 15\u201322 (1994)","journal-title":"Contemporary Mathematics"},{"key":"10_CR9","first-page":"281","volume-title":"Communication, Control and Singal Processing","author":"A.B. Cooper III","year":"1990","unstructured":"Cooper III, A.B.: Direct solution of BCH decoding equations. In: Arikan, E. (ed.) Communication, Control and Singal Processing, pp. 281\u2013286. Elsevier, Amsterdam (1990)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1049\/el:19911294","volume":"27","author":"A.B. Cooper III","year":"1991","unstructured":"Cooper III, A.B.: Finding BCH error locator polynomials in one step. Electronic Letters\u00a027, 2090\u20132091 (1991)","journal-title":"Electronic Letters"},{"unstructured":"Giorgetti, M., Sala, M.: A commutative algebra approach to linear codes, BCRI preprint, 58, UCC Cork, Ireland (2006), www.bcri.ucc.ie","key":"10_CR11"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s002000050084","volume":"8","author":"P. Loustaunau","year":"1997","unstructured":"Loustaunau, P., York, E.V.: On the decoding of cyclic codes using Gr\u00f6bner bases. J. AAECC\u00a08, 469\u2013483 (1997)","journal-title":"J. AAECC"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jpaa.2004.12.027","volume":"200","author":"E. Orsini","year":"2005","unstructured":"Orsini, E., Sala, M.: Correcting errors and erasures via the syndrome variety. J. Pure Appl. Algebra\u00a0200, 191\u2013226 (2005)","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TIT.2006.889465","volume":"53","author":"E. Orsini","year":"2007","unstructured":"Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with t\u2009\u2264\u20092 and n\u2009<\u200963. IEEE Trans. Inform. Theory\u00a053, 1095\u20131107 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"unstructured":"Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with t \u2264 2 and n < 63, BCRI preprint (2005), http:\/\/www.bcri.ucc.ie","key":"10_CR15"}],"container-title":["Lecture Notes in Computer Science","Mathematical Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89994-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T21:58:04Z","timestamp":1557957484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89994-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899938","9783540899945"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89994-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}