{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:53:55Z","timestamp":1742799235252},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429111"},{"type":"electronic","value":"9783540456247"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_36","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"343-352","source":"Crossref","is-referenced-by-count":2,"title":["A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding"],"prefix":"10.1007","author":[{"given":"Margreta","family":"Kuijper","sequence":"first","affiliation":[]},{"given":"Marten","family":"van Dijk","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Hollmann","sequence":"additional","affiliation":[]},{"given":"Job","family":"Oostveen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"36_CR1","first-page":"1026","volume":"E75\u2013A","author":"K. Araki","year":"1992","unstructured":"Araki, K. and I. Fujita (1992). Generalized syndrome polynomials for decoding Reed-Solomon codes. IEICE Trans. Fundamentals\n                           E75\u2013A, 1026\u20131029.","journal-title":"IEICE Trans. Fundamentals"},{"doi-asserted-by":"crossref","unstructured":"Araki, K., Takada, M. and M. Morii (1992). On the efficient decoding of Reed-Solomon codes based on GMD criterion. Proc. 22nd Int. Symp. on Multiple Valued Logic, 138\u2013142.","key":"36_CR2","DOI":"10.1109\/ISMVL.1992.186788"},{"key":"36_CR3","first-page":"594","volume":"E76\u2013D","author":"K. Araki","year":"1993","unstructured":"Araki, K., Takada, M. and M. Morii (1993). The efficient GMD decoders for BCH codes. IEICE Trans. Inform. and Systems\n                           E76\u2013D, 594\u2013604.","journal-title":"IEICE Trans. Inform. and Systems"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/18.490539","volume":"42","author":"E.R. Berlekamp","year":"1996","unstructured":"Berlekamp, E.R. (1996). Bounded distance+1 soft-decision Reed-Solomon decoding. IEEE Trans. Inform. Theory\n                           42, 704\u2013721.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1008290027201","volume":"11","author":"S.R. Blackburn","year":"1997","unstructured":"Blackburn, S.R. (1997). A generalized rational interpolation problem and the solution of the WB algorithm. Designs,Co des and Cryptography\n                           11, 223\u2013234.","journal-title":"Designs,Co des and Cryptography"},{"unstructured":"Blahut, R.E. (1983). Theory and Practice of Error Control Codes, Addison-Wesley.","key":"36_CR6"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TIT.1954.1057464","volume":"PGIT\u20134","author":"P. Elias","year":"1954","unstructured":"Elias, P. (1954). Error-free coding. IRE Trans. Inform. Theory\n                           PGIT\u20134, 29\u201337.","journal-title":"IRE Trans. Inform. Theory"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1109\/18.412677","volume":"41","author":"P. Fitzpatrick","year":"1995","unstructured":"Fitzpatrick, P. (1995). On the key equation. IEEE Trans. Inform. Theory\n                           41, 1290\u20131302.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"12","author":"G.D. Forney Jr","year":"1966","unstructured":"Forney, G.D., Jr. (1966). Generalized minimum distance decoding. IEEE Trans. Inform. Theory\n                           12, 125\u2013131.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR10","first-page":"82","volume":"13","author":"M. Fujisawa","year":"1999","unstructured":"Fujisawa, M. and S. Sakata (1999). On fast generalized minimum distance decoding for algebraic codes. Preproc. AAECC-13, 82\u201383.","journal-title":"Preproc. AAECC-"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1006\/ffta.1995.1035","volume":"1","author":"N. Kamiya","year":"1995","unstructured":"Kamiya, N. (1995). On multisequence shift register synthesis and generalizedminimum-distance decoding of Reed-Solomon codes. Finite Fields Appl. 1, 440\u2013457.","journal-title":"Finite Fields Appl"},{"key":"36_CR12","first-page":"1998","volume":"E82\u2013A","author":"N. Kamiya","year":"1999","unstructured":"Kamiya, N. (1999). A unified algorithm for solving key equations for decoding alternant codes. IEICE Trans. Fundamentals, E82\u2013A, 1998\u20132006.","journal-title":"IEICE Trans. Fundamentals"},{"key":"36_CR13","first-page":"71","volume":"83","author":"Y. Kobayashi","year":"2000","unstructured":"Kobayashi, Y., Fujisawa, M. and S. Sakata (2000). Constrained shiftregister synthesis: fast GMD decoding of 1D algebraic codes. IEICE Trans. Fundamentals\n                           83, 71\u201380.","journal-title":"IEICE Trans. Fundamentals"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/18.490540","volume":"42","author":"R. K\u00f6tter","year":"1996","unstructured":"K\u00f6tter, R. (1996). Fast generalized minimum distance decoding of algebraic geometric and Reed-Solomon codes. IEEE Trans. Inform. Theory\n                           42, 721\u2013738.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/9.649704","volume":"42","author":"M. Kuijper","year":"1997","unstructured":"Kuijper, M. and J.C. Willems (1997). On constructing a shortest linear recurrence relation. IEEE Trans. Aut. Control\n                           42, 1554\u20131558.","journal-title":"IEEE Trans. Aut. Control"},{"doi-asserted-by":"crossref","unstructured":"Kuijper, M. (1999). The BM algorithm, error-correction, keystreams and modeling. In Dynamical Systems,Control, Coding,Computer Vision, G. Picci, D. S. Gilliam (eds.), Birkh\u00e4user","key":"36_CR16","DOI":"10.1007\/978-3-0348-8970-4_15"},{"unstructured":"Kuijper, M. (1999). Further results on the use of a generalized BM algorithm for BCH decoding beyond the designed error-correcting capability, Proc. 13th AAECC, Hawaii, USA (1999), 98\u201399.","key":"36_CR17"},{"doi-asserted-by":"crossref","unstructured":"Kuijper, M. (2000). Algorithms for Decoding and Interpolation. In Codes,Systems, and Graphical Models, IMA Series Vol. 123, B. Marcus and J. Rosenthal (eds.), pp. 265\u2013282, Springer-Verlag.","key":"36_CR18","DOI":"10.1007\/978-1-4613-0165-3_14"},{"unstructured":"Kuijper, M. (2000). A system-theoretic derivation of the WB algorithm, in Proc. IEEE International Symposium on Information Theory (ISIT\u201900) p. 418.","key":"36_CR19"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/18.212267","volume":"39","author":"U. Sorger","year":"1993","unstructured":"Sorger, U. (1993). A new Reed-Solomon decoding algorithm based on Newton\u2019s interpolation. IEEE Trans. Inform. Theory\n                           39, 358\u2013365.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/18.335962","volume":"40","author":"D.J. Taipale","year":"1994","unstructured":"Taipale, D.J. and M.J. Seo (1994). An efficient soft-decision Reed-Solomon decoding algorithm. IEEE Trans. Info. Theory\n                           40, 1130\u20131139.","journal-title":"IEEE Trans. Info. Theory"},{"unstructured":"Wicker, S.B. (1995). Error control systems, Prentice Hall.","key":"36_CR22"},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/9.73561","volume":"36","author":"J.C. Willems","year":"1991","unstructured":"Willems, J.C. (1991). Paradigms and puzzles in the theory of dynamical systems. IEEE Trans. Aut. Control\n                           36, 259\u2013294.","journal-title":"IEEE Trans. Aut. Control"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T03:33:14Z","timestamp":1550374394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}