{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:04:34Z","timestamp":1775012674384,"version":"3.50.1"},"reference-count":18,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1134\/s0032946007030027","type":"journal-article","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:38:33Z","timestamp":1193553513000},"page":"190-198","source":"Crossref","is-referenced-by-count":2,"title":["Interpolation in list decoding of Reed-Solomon codes"],"prefix":"10.1134","volume":"43","author":[{"given":"P. V.","family":"Trifonov","sequence":"first","affiliation":[]}],"member":"137","reference":[{"key":"3002_CR1","unstructured":"Elias, P., List Decoding for Noisy Channels, Tech. Report of the Research Laboratory of Electronics, MIT, 1957, no. 335."},{"issue":"6","key":"3002_CR2","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V. and Sudan, M., Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 6, pp. 1757\u20131767.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"3002_CR3","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","volume":"49","author":"R. Koetter","year":"2003","unstructured":"Koetter, R. and Vardy, A., Algebraic Soft-Decision Decoding of Reed-Solomon Codes, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 11, pp. 2809\u20132825.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3002_CR4","first-page":"221","volume-title":"Coding Theory, Crytography and Related Areas (Proc. ICCC\u201998, Guanajuato, Mexico)","author":"R.R. Nielsen","year":"1999","unstructured":"Nielsen, R.R. and Hoholdt, T., Decoding Reed-Solomon Codes Beyond Half the Minimum Distance, in Coding Theory, Crytography and Related Areas (Proc. ICCC\u201998, Guanajuato, Mexico), Berlin: Springer, 1999, pp. 221\u2013236."},{"key":"3002_CR5","unstructured":"Ma, J., Trifonov, P., and Vardy, A., Divide-and-Conquer Interpolation for List Decoding of Reed-Solomon Codes, in Proc. 2004 IEEE Int. Sympos. on Information Theory, Chicago, USA, p. 387."},{"key":"3002_CR6","doi-asserted-by":"crossref","unstructured":"Koetter, R., Ma, J., Vardy, A., and Ahmed, A., Efficient Interpolation and Factorization in Algebraic Soft-Decision Decoding of Reed-Solomon Codes, in Proc. 2003 IEEE Int. Sympos. on Information Theory, Yokohama, Japan, p. 365.","DOI":"10.1109\/ISIT.2003.1228381"},{"issue":"1","key":"3002_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/18.817522","volume":"46","author":"R. Roth","year":"2000","unstructured":"Roth, R. and Ruckenstein, G., Efficient Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance, IEEE Trans. Inform. Theory, 2000, vol. 46, no. 1, pp. 246\u2013257.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3002_CR8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D. Cox","year":"1997","unstructured":"Cox, D., Little, G., and O\u2019shea, D., Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, New York: Springer, 1997, 2nd ed. Translated under the title Idealy, mnogoobraziya i algoritmy, Moscow: Mir, 2000.","edition":"2"},{"key":"3002_CR9","volume-title":"Linear Systems","author":"T. Kailath","year":"1980","unstructured":"Kailath, T., Linear Systems, Englewood Cliffs: Prentice-Hall, 1980."},{"key":"3002_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1993","unstructured":"Becker, T. and Weispfenning, V., Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra, New York: Springer, 1993."},{"key":"3002_CR11","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/CBO9780511565847.030","volume-title":"Gr\u00f6bner Bases and Applications","author":"T. Sauer","year":"1998","unstructured":"Sauer, T., Polynomial Interpolation of Minimal Degree and Gr\u00f6bner Bases, Gr\u00f6bner Bases and Applications, Buchberger, B. and Winkler, F., Eds., London Math. Soc. Lecture Note Ser., vol. 251, Cambridge: Cambridge Univ. Press, 1998, pp. 483\u2013494."},{"issue":"2","key":"3002_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01386834","volume":"4","author":"M.G. Marinari","year":"1993","unstructured":"Marinari, M.G., Moller, H.M., and Mora, T., Gr\u00f6bner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points, Appl. Algebra Engrg. Comm. Comput., 1993, vol. 4, no. 2, pp. 103\u2013145.","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"3002_CR13","volume-title":"Fast Algorithms for Digital Signal Processing","author":"R.E. Blahut","year":"1985","unstructured":"Blahut, R.E., Fast Algorithms for Digital Signal Processing, Reading: Addison-Wesley, 1985. Translated under the title Bystrye algoritmy tsifrovoi obrabotki signalov, Moscow: Mir, 1989."},{"key":"3002_CR14","volume-title":"Theory and Practice of Error Control Codes","author":"R.E. Blahut","year":"1983","unstructured":"Blahut, R.E., Theory and Practice of Error Control Codes, Reading: Addison-Wesley, 1983. Translated under the title Teoriya i praktika kodov, kontroliruyushchikh oshibki, Moscow: Mir, 1986."},{"issue":"4","key":"3002_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faugere","year":"1993","unstructured":"Faugere, J.-C., Gianni, P., Lazard, D., and Mora, T., Efficient Computation of Zero-Dimensional Gr\u00f6bner Bases by Change of Ordering, J. Symbolic Comput., 1993, vol. 16, no. 4, pp. 329\u2013344.","journal-title":"J. Symbolic Comput."},{"key":"3002_CR16","doi-asserted-by":"crossref","unstructured":"Basiri, A. and Faugere, J.-C., Changing the Ordering of Gr\u00f6bner Bases with LLL: Case of Two Variables, in Proc. Int. Sympos. on Symbolic and Algebraic Computation, Philadelphia, USA 2003, pp. 23\u201329.","DOI":"10.1145\/860854.860866"},{"issue":"7","key":"3002_CR17","doi-asserted-by":"publisher","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-Solomon Codes, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 7, pp. 2257\u20132265.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3002_CR18","unstructured":"Trifonov, P., On the Interpolation Step in the Guruswami-Sudan List Decoding Algorithm for Reed-Solomon Codes, in Proc. 10th Int. Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod, Russia, 2006, pp. 269\u2013272."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007030027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946007030027","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007030027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007030027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:02:12Z","timestamp":1775008932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946007030027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["3002"],"URL":"https:\/\/doi.org\/10.1134\/s0032946007030027","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}