{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T05:22:13Z","timestamp":1706073733309},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10623-012-9626-1","type":"journal-article","created":{"date-parts":[[2012,7,17]],"date-time":"2012-07-17T15:55:54Z","timestamp":1342540554000},"page":"107-121","source":"Crossref","is-referenced-by-count":3,"title":["Simple algorithms for decoding systematic Reed\u2013Solomon codes"],"prefix":"10.1007","volume":"69","author":[{"given":"Todd D.","family":"Mateer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"key":"9626_CR1","volume-title":"Theory and Practice of Error Control Codes","author":"R. Blahut","year":"1984","unstructured":"Blahut R.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1984)"},{"key":"9626_CR2","volume-title":"Algebraic Codes for Data Transmission","author":"R. Blahut","year":"2002","unstructured":"Blahut R.: Algebraic Codes for Data Transmission, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"9626_CR3","doi-asserted-by":"crossref","unstructured":"Chen N., Yan Z.: Complexity analysis of Reed\u2013Solomon decoding over GF(2 m ) without using syndromes. EURASIP Journal on Wireless Communications and Networking, Advances in Error Control Coding Techniques (2008).","DOI":"10.1155\/2008\/843634"},{"issue":"4","key":"9626_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/LSP.2009.2014292","volume":"16","author":"N. Chen","year":"2009","unstructured":"Chen N., Yan Z.: Reduced-complexity Reed\u2013Solomon decoders based on cyclotomic FFTs. IEEE Signal Process. Lett. 16(4), 279 (2009)","journal-title":"IEEE Signal Process. Lett."},{"issue":"4","key":"9626_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/ett.982","volume":"15","author":"E. Costa","year":"2004","unstructured":"Costa E., Fedorenko S.V., Trifonov P.V.: On computing the syndrome polynomial in Reed\u2013Solomon decoder. Eur. Trans. Telecomm. 15(4), 337\u2013342 (2004)","journal-title":"Eur. Trans. Telecomm."},{"key":"9626_CR6","unstructured":"Fedorenko S.V.: A simple algorithm for decoding both errors and erasures of Reed\u2013Solomon codes. Proceedings of the Workshop \u201cCoding Theory Days in St. Petersburg\u201d, pp.18\u201321. Russia (2008)."},{"issue":"3","key":"9626_CR7","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1109\/TIT.2004.842738","volume":"51","author":"S.V. Fedorenko","year":"2005","unstructured":"Fedorenko S.V.: A simple algorithm for decoding Reed\u2013Solomon codes and its relation to the Welch Berlekamp algorithm. IEEE Trans. Inf. Theory 51(3), 1196\u20131198 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9626_CR8","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/TIT.2005.864417","volume":"52","author":"S.V. Fedorenko","year":"2006","unstructured":"Fedorenko S.V.: Correction to \u2018A simple algorithm for decoding Reed\u2013Solomon codes and its relation to the Welch Berlekamp algorithm\u2019. IEEE Trans. Inf. Theory 52(3), 1278 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9626_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1134\/S0032946006020074","volume":"42","author":"S.V. Fedorenko","year":"2006","unstructured":"Fedorenko S.V.: A method for computation of the discrete Fourier transform over a finite field. Probl. Inf. Transm. 42(2), 139\u2013151 (2006)","journal-title":"Probl. Inf. Transm."},{"key":"9626_CR10","unstructured":"Fedorenko S.V.: On semifast Fourier transform algorithms. Proceedings of the XII international symposium on problems of redundancy in information and control systems at St.Petersburg, pp. 65\u201370. Russia (2009)."},{"key":"9626_CR11","unstructured":"Gao S.: A new algorithm for decoding Reed\u2013Solomon codes. In: Bhargava V., Poor H.V., Tarokh V., Yoon S. (eds) Communications, Information and Network Security, vol. 712, pp. 55\u201368. Kluwer, Norwell (2003)."},{"issue":"12","key":"9626_CR12","doi-asserted-by":"crossref","first-page":"6265","DOI":"10.1109\/TIT.2010.2079016","volume":"56","author":"S. Gao","year":"2010","unstructured":"Gao S., Mateer T.D.: Additive fast Fourier transforms over finite fields. IEEE Trans. Inf. Theory 56(12), 6265\u20136272 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9626_CR13","unstructured":"von zur Gathen J., Gerhard J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003). ISBN: 0 521 82646 2."},{"key":"9626_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0109020","volume":"9","author":"D. Gorenstein","year":"1961","unstructured":"Gorenstein D., Zierler N.: A class of error-correcting codes in p m symbols. J. Soc. Indust. Appl. Math. 9, 207\u2013214 (1961)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"9626_CR15","volume-title":"Error Control Coding","author":"S. Lin","year":"2004","unstructured":"Lin S., Costello D.J.: Error Control Coding, 2nd edn. Prentice Hall, Upper Saddle River (2004)","edition":"2"},{"issue":"6","key":"9626_CR16","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1109\/TCOMM.2009.06.080080","volume":"57","author":"T.-C. Lin","year":"2009","unstructured":"Lin T.-C., Chen P.-D., Truong T.-K.: Simplified procedure for decoding nonsystematic Reed\u2013Solomon codes over GF(2 m ) using Euclid\u2019s algorithm and the fast Fourier transform. IEEE Trans. Commun. 57(6), 1588\u20131592 (2009)","journal-title":"IEEE Trans. Commun."},{"key":"9626_CR17","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory IT- 15, 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory IT-"},{"key":"9626_CR18","unstructured":"Mateer T.D.: Fast Fourier transform algorithms with applications. PhD Dissertation. Available at: http:\/\/cr.yp.to\/f2mult\/mateer-thesis.pdf ."},{"key":"9626_CR19","unstructured":"Mateer T.D.: On the equivalence of the Berlekamp\u2013Massey and Euclidean algorithms for algebraic decoding. Proceedings of the 2011 Canadian Workshop on Information Theory (IEEE), Kelowna, British Columbia, Canada (2011)."},{"key":"9626_CR20","volume-title":"The theory of information and coding","author":"R.J. McEliece","year":"1977","unstructured":"McEliece R.J.: The theory of information and coding. Addison-Wesley, Reading (1977)"},{"key":"9626_CR21","doi-asserted-by":"crossref","unstructured":"Moon T.K.: Error correction coding: mathematical methods and algorithms. Wiley, Hoboken (2005). ISBN: 0-471-64800-0.","DOI":"10.1002\/0471739219"},{"key":"9626_CR22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed I.S., Solomon G.: Polynomial codes over certain finite fields. SIAM J. Appl. Math. 8, 300\u2013304 (1960)","journal-title":"SIAM J. Appl. Math."},{"issue":"5","key":"9626_CR23","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1109\/18.21269","volume":"34","author":"A. Shiozaki","year":"1988","unstructured":"Shiozaki A.: Decoding of redundant residue polynomial codes using Euclid\u2019s algorithm. IEEE Trans. Inf. Theory 34(5), 1351\u20131354 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9626_CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1026171930630","volume":"39","author":"P.V. Trifonov","year":"2003","unstructured":"Trifonov P.V., Fedorenko S.V.: A method for fast computation of the Fourier transform over a finite field. Prob. Inf. Transm., 39(3), 231\u2013238 (2003)","journal-title":"Prob. Inf. Transm.,"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9626-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9626-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9626-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T02:47:47Z","timestamp":1561949267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9626-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9626"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9626-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}