{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:17Z","timestamp":1760061677169,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,22]],"date-time":"2012-07-22T00:00:00Z","timestamp":1342915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-BS02-013 (Pernet)"],"award-info":[{"award-number":["ANR-11-BS02-013 (Pernet)"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0830347, CCF-1115772"],"award-info":[{"award-number":["CCF-0830347, CCF-1115772"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,7,22]]},"DOI":"10.1145\/2442829.2442852","type":"proceedings-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T19:25:33Z","timestamp":1361561133000},"page":"138-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Sparse polynomial interpolation and Berlekamp\/Massey algorithms that correct outlier errors in input values"],"prefix":"10.1145","author":[{"given":"Matthew T.","family":"Comer","sequence":"first","affiliation":[{"name":"NCSU Raleigh, NC"}]},{"given":"Erich L.","family":"Kaltofen","sequence":"additional","affiliation":[{"name":"NCSU Raleigh, NC"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Joseph Fourier, Grenoble, France"}]}],"member":"320","published-online":{"date-parts":[[2012,7,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.233.0299"},{"key":"e_1_3_2_1_3_1","volume-title":"Theory and Practice of Error Control Codes","author":"Blahut R. E.","year":"1983","unstructured":"Blahut , R. E. Theory and Practice of Error Control Codes . Addison-Wesley , 1983 . Blahut, R. E. Theory and Practice of Error Control Codes. Addison-Wesley, 1983."},{"key":"e_1_3_2_1_4_1","volume-title":"Signal enhancement---a composite property mapping approach","author":"Cadzow J. A.","year":"1988","unstructured":"Cadzow , J. A. Signal enhancement---a composite property mapping approach . IEEE Trans. Acoust., Speech, Signal Process. ASSP- 36 ( 1988 ), 49--62. Cadzow, J. A. Signal enhancement---a composite property mapping approach. IEEE Trans. Acoust., Speech, Signal Process. ASSP-36 (1988), 49--62."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.030"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00087-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.11.003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0294-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993909"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.56"},{"key":"e_1_3_2_1_11_1","series-title":"Lect","first-page":"162","volume-title":"Proc. AAECC-10","author":"Grigoriev D. Y.","year":"1993","unstructured":"Grigoriev , D. Y. , and Karpinski , M . A zero-test and an interpolation algorithm for the shifted sparse polynomials . In Proc. AAECC-10 ( 1993 ), vol. 673 of Lect . Notes Comput. Sci., Springer Verlag , pp. 162 -- 169 . Grigoriev, D. Y., and Karpinski, M. A zero-test and an interpolation algorithm for the shifted sparse polynomials. In Proc. AAECC-10 (1993), vol. 673 of Lect. Notes Comput. Sci., Springer Verlag, pp. 162--169."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057261"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96912"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00088-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277500.1277503"},{"key":"e_1_3_2_1_16_1","volume-title":"Dec.","author":"Kaltofen E.","year":"2006","unstructured":"Kaltofen , E. , and Yuhasz , G . On the matrix Berlekamp-Massey algorithm , Dec. 2006 . Manuscript, 29 pages. Submitted . Kaltofen, E., and Yuhasz, G. On the matrix Berlekamp-Massey algorithm, Dec. 2006. Manuscript, 29 pages. Submitted."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837213"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331684.2331704"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993916"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837985"},{"key":"e_1_3_2_1_21_1","volume-title":"Ed. Proc. 2011 ISSAC","author":"Leykin A.","year":"2011","unstructured":"Leykin , A. , Ed. Proc. 2011 ISSAC ( 2011 ), ACM. Leykin, A., Ed. Proc. 2011 ISSAC (2011), ACM."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Massey J. and \n      Schaub T\n  . \n  Linear complexity in coding theory\n  . In Coding Theory and Applications G. Cohen and P. Godlewski Eds. vol. \n  311\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer Verlag 1988 pp. \n  19\n  --\n  32\n  .   Massey J. and Schaub T. Linear complexity in coding theory. In Coding Theory and Applications G. Cohen and P. Godlewski Eds. vol. 311 of Lecture Notes in Computer Science . Springer Verlag 1988 pp. 19--32.","DOI":"10.1007\/3-540-19368-5_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1088886"},{"key":"e_1_3_2_1_25_1","unstructured":"Prony R. Essai exp\u00e9rimental et analytique sur les lois del la Dilatabilit\u00e9 de fluides \u00e9lastique et sur celles de la Force expansive de la vapeur de l'eau et de la vapeur de l'alkool \u00e0 diff\u00e9rentes temp\u00e9ratures. J. de l'\u00c9cole Polytechnique 1 (Flor\u00e9al et Prairial III (1795)) 24--76.  Prony R. Essai exp\u00e9rimental et analytique sur les lois del la Dilatabilit\u00e9 de fluides \u00e9lastique et sur celles de la Force expansive de la vapeur de l'eau et de la vapeur de l'alkool \u00e0 diff\u00e9rentes temp\u00e9ratures. J. de l'\u00c9cole Polytechnique 1 (Flor\u00e9al et Prairial III (1795)) 24--76."},{"key":"e_1_3_2_1_26_1","first-page":"2","article-title":"Polynomial codes over certain finite fields","volume":"8","author":"Reed I. S.","year":"1960","unstructured":"Reed , I. S. , and Solomon , G. S . Polynomial codes over certain finite fields . J. SIAM 8 , 2 ( June 1960 ), 300--304. Reed, I. S., and Solomon, G. S. Polynomial codes over certain finite fields. J. SIAM 8, 2 (June 1960), 300--304.","journal-title":"J. SIAM"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479802405732"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.38"},{"key":"e_1_3_2_1_29_1","unstructured":"Yuhasz G. Berlekamp\/Massey Algorithms for Linearly Generated Matrix Sequences. PhD thesis North Carolina State Univ. Raleigh North Carolina May 2009.   Yuhasz G. Berlekamp\/Massey Algorithms for Linearly Generated Matrix Sequences . PhD thesis North Carolina State Univ. Raleigh North Carolina May 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80018-1"}],"event":{"name":"ISSAC'12: International Symposium on Symbolic and Algebraic Computation","sponsor":["Grenoble University Grenoble University","INRIA Institut Natl de Recherche en Info et en Automatique","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Grenoble France","acronym":"ISSAC'12"},"container-title":["Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442829.2442852","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442829.2442852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:39Z","timestamp":1750234719000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442829.2442852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,22]]},"references-count":30,"alternative-id":["10.1145\/2442829.2442852","10.1145\/2442829"],"URL":"https:\/\/doi.org\/10.1145\/2442829.2442852","relation":{},"subject":[],"published":{"date-parts":[[2012,7,22]]},"assertion":[{"value":"2012-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}