{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:30:10Z","timestamp":1725496210499},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77224-8_9","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T05:38:56Z","timestamp":1196314736000},"page":"50-59","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Sudan\u2019s List Decoding for Order Domain Codes"],"prefix":"10.1007","author":[{"given":"Olav","family":"Geil","sequence":"first","affiliation":[]},{"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, H.E., Geil, O.: Evaluation Codes From Order Domain Theory. Finite Fields and Their Appl. (2007) doi:10.1016\/j.ffa.2006.12.004","DOI":"10.1016\/j.ffa.2006.12.004"},{"key":"9_CR2","unstructured":"Augot, D., Stepanov, M.: Decoding Reed-Muller Codes with the Guruswami-Sudan\u2019s Algorithm. In: Slides of Talk Given by D. Augot at Workshop D1 Special Semester on Gr\u00f6bner Bases and Related Methods, RICAM, Linz (2006), \n                    \n                      http:\/\/www.ricam.oeaw.ac.at\/specsem\/srs\/groeb\/download\/Augot.pdf"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1006\/ffta.2001.0347","volume":"8","author":"O. Geil","year":"2002","unstructured":"Geil, O., Pellikaan, R.: On the Structure of Order Domains. Finite Fields and Their Appl.\u00a08, 369\u2013396 (2002)","journal-title":"Finite Fields and Their Appl."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S1071-5797(03)00010-8","volume":"9","author":"O. Geil","year":"2003","unstructured":"Geil, O.: On Codes From Norm-Trace Curves. Finite Fields and Their Appl.\u00a09, 351\u2013371 (2003)","journal-title":"Finite Fields and Their Appl."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes. IEEE Trans. Inform. Theory\u00a045(4), 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR6","first-page":"871","volume-title":"Handbook of Coding Theory","author":"T. H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt, T., van Lint, J., Pellikaan, R.: Algebraic Geometry Codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 871\u2013961. Elsevier, Amsterdam (1998)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/ffta.2000.0283","volume":"7","author":"M.E. O\u2019Sullivan","year":"2001","unstructured":"O\u2019Sullivan, M.E.: New Codes for the Berlekamp-Massey-Sakata Algorithm. Finite Fields and Their Appl.\u00a07, 293\u2013317 (2001)","journal-title":"Finite Fields and Their Appl."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.2004.825043","volume":"50","author":"R. Pellikaan","year":"2004","unstructured":"Pellikaan, R., Wu, X.-W.: List Decoding of q-ary Reed-Muller Codes. IEEE Trans. Inform. Theory\u00a050, 679\u2013682 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.748993","volume":"45","author":"M.A. Shokrollahi","year":"1999","unstructured":"Shokrollahi, M.A., Wasserman, H.: List Decoding of Algebraic-Geometric Codes. IEEE Trans. Inform. Theory\u00a045(2), 432\u2013437 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Sudan, M.: Decoding of Reed Solomon Codes Beyond the Error Correction Bound. J. Complexity\u00a013, 180\u2013193 (1997)","journal-title":"J. Complexity"},{"key":"9_CR11","first-page":"202","volume-title":"2002 IEEE International Symposium on Information Theory","author":"X.-W. Wu","year":"2002","unstructured":"Wu, X.-W.: An Algorithm for Finding the Roots of the Polynomials Over Order Domains. In: 2002 IEEE International Symposium on Information Theory, p. 202. IEEE Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77224-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:52Z","timestamp":1619507092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77224-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772231"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77224-8_9","relation":{},"subject":[]}}