{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:45:44Z","timestamp":1648694744940},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T00:00:00Z","timestamp":1372723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00200-013-0191-2","type":"journal-article","created":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T11:06:47Z","timestamp":1372676807000},"page":"237-253","source":"Crossref","is-referenced-by-count":0,"title":["List decoding of repeated codes"],"prefix":"10.1007","volume":"24","author":[{"given":"Fernando","family":"Hernando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Ruano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,2]]},"reference":[{"issue":"7","key":"191_CR1","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1109\/TIT.2005.850097","volume":"51","author":"M Alekhnovich","year":"2005","unstructured":"Alekhnovich, M.: Linear Diophantine equations over polynomials and soft decoding of Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 51(7), 2257\u20132265 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3\u20134","key":"191_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"191_CR3","unstructured":"Dumer I.I.: Concatenated codes and their multilevel generalizations. In: Pless, V. Huffman W. C. (eds.) Handbook of Coding Theory, vol. I, II, pp. 1911\u20131988. North-Holland, Amsterdam (1998)"},{"key":"191_CR4","unstructured":"Elias, P.: List decoding for noisy channels. Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Mass., Rep. No. 335 (1957)"},{"issue":"6","key":"191_CR5","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed\u2013Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"191_CR6","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","volume":"49","author":"R Koetter","year":"2003","unstructured":"Koetter, R., Vardy, A.: Algebraic soft-decision decoding of Reed\u2013Solomon codes. IEEE Trans. Inf. Theory 49(11), 2809\u20132825 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"191_CR7","unstructured":"Lally, K.: Quasicyclic codes\u2014some practical issues. In: Proceedings. 2002 IEEE International Symposium on Information Theory (2002)"},{"key":"191_CR8","doi-asserted-by":"crossref","unstructured":"Lee, K., O\u2019Sullivan, M.E.: An interpolation algorithm using Groebner bases for soft-decision decoding of Reed\u2013Solomon codes. In: Proceedings. 2006 IEEE International Symposium on Information Theory, vol. 7, pp. 2032\u20132036 (2006)","DOI":"10.1109\/ISIT.2006.261906"},{"issue":"9","key":"191_CR9","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.jsc.2008.01.002","volume":"43","author":"K Lee","year":"2008","unstructured":"Lee, K., O\u2019Sullivan, M.E.: List decoding of Reed\u2013Solomon codes from a Gr\u00f6bner basis perspective. J. Symb. Comput. 43(9), 645\u2013658 (2008)","journal-title":"J. Symb. Comput."},{"key":"191_CR10","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, vol. 16. North-Holland Publishing Co., North-Holland Mathematical Library, Amsterdam (1977)"},{"key":"191_CR11","doi-asserted-by":"crossref","unstructured":"Sudan, M.: Decoding of Reed\u2013Solomon codes beyond the error-correction bound. J. Complexity. 13(1), 180\u2013193 (1997)","DOI":"10.1006\/jcom.1997.0439"},{"key":"191_CR12","unstructured":"Wozencraft, J.M.: List decoding. In: Quarterly Progress Report, pp. 90\u201395. Research Laboratory of Electronics, MIT, Cambridge, MA (1958)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-013-0191-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-013-0191-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-013-0191-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:24Z","timestamp":1558610664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-013-0191-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,2]]},"references-count":12,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["191"],"URL":"https:\/\/doi.org\/10.1007\/s00200-013-0191-2","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,2]]}}}