{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:11:15Z","timestamp":1730319075450,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1145\/301250.301311","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"235-244","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["A displacement approach to efficient decoding of algebraic-geometric codes"],"prefix":"10.1145","author":[{"given":"Vadim","family":"Olshevsky","sequence":"first","affiliation":[{"name":"Department of Mathematics, Georgia State University"}]},{"given":"M. Amin","family":"Shokrollahi","sequence":"additional","affiliation":[{"name":"Department of Fundamental Mathematics, Bell Labs"}]}],"member":"320","published-online":{"date-parts":[[1999,5]]},"reference":[{"volume-title":"Proc. 33rd FOC$, p~ges 503- 512","year":"1992","author":"Ar S.","key":"e_1_3_2_1_1_2","unstructured":"S. Ar , R. Lipton , R. Rubinfeld , and M. Sudan . Reconstructing ~lgebraic functions from mixed dat~ . In Proc. 33rd FOC$, p~ges 503- 512 , 1992 . S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan. Reconstructing ~lgebraic functions from mixed dat~. In Proc. 33rd FOC$, p~ges 503- 512, 1992."},{"volume-title":"Algebraic Coding Theory","year":"1968","author":"Berlekamp E.R.","key":"e_1_3_2_1_2_2","unstructured":"E.R. Berlekamp . Algebraic Coding Theory . McGraw-Hill , New York , 1968 . E.R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, 1968."},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.490539"},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90161-5"},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.179340"},{"volume-title":"Preprint","year":"1998","author":"Gao S.","key":"e_1_3_2_1_6_2","unstructured":"S. Gao and M.A. Shokrollahi . Computing roots of polynomials over function fields of curves . Preprint , 1998 . S. Gao and M.A. Shokrollahi. Computing roots of polynomials over function fields of curves. Preprint, 1998."},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01194749"},{"key":"e_1_3_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796393"},{"key":"e_1_3_2_1_9_2","series-title":"Operator Theory","volume-title":"Algebraic Methods for Toeplitz-like matrices and operators","author":"Heinig G.","year":"1984","unstructured":"G. Heinig and K. Rost . Algebraic Methods for Toeplitz-like matrices and operators , volume 13 of Operator Theory . Birkh&user, Boston , 1984 . G. Heinig and K. Rost. Algebraic Methods for Toeplitz-like matrices and operators, volume 13 of Operator Theory. Birkh&user, Boston, 1984."},{"volume-title":"Decoding Hermiti~n codes with Sudan's algorithm. Preprint","year":"1999","author":"Refslund Nielsen T.","key":"e_1_3_2_1_10_2","unstructured":"T. H0holdt and R. Refslund Nielsen . Decoding Hermiti~n codes with Sudan's algorithm. Preprint , Denmark Technical University , 1999 . T. H0holdt and R. Refslund Nielsen. Decoding Hermiti~n codes with Sudan's algorithm. Preprint, Denmark Technical University, 1999."},{"key":"e_1_3_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.476214"},{"key":"e_1_3_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.108255"},{"key":"e_1_3_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/1037082"},{"volume-title":"North- Holland","year":"1988","author":"Slo~ne F.J.","key":"e_1_3_2_1_14_2","unstructured":"F.J. MacWilliams ~nd N.J.A. Slo~ne . The Theory of Error-Correcting Codes . North- Holland , 1988 . F.J. MacWilliams ~nd N.J.A. Slo~ne. The Theory of Error-Correcting Codes. North- Holland, 1988."},{"key":"e_1_3_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1980.1171074"},{"key":"e_1_3_2_1_17_2","unstructured":"V. Olshevsky. Pivoting for structured matrices with ~pplications. http:\/\/www.cs.gsu.edu\/~ matvro 1997. V. Olshevsky. Pivoting for structured matrices with ~pplications. http:\/\/www.cs.gsu.edu\/~ matvro 1997."},{"key":"e_1_3_2_1_18_2","first-page":"192","volume-title":"Proceedings of the 39th IEEE Symposium on Foundations of Computer Science","author":"Olshevsky V.","year":"1998","unstructured":"V. Olshevsky and V. P~n . A superfast statespace ~lgorithm for tangential Nevanlinna- Pick interpolation problem . In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science , pages 192 - 201 , 1998 . V. Olshevsky and V. P~n. A superfast statespace ~lgorithm for tangential Nevanlinna- Pick interpolation problem. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 192-201, 1998."},{"volume-title":"Prceedings of 1998 EIII International Symposium on Information Theory, p~ges 56-56","year":"1998","author":"Roth R.","key":"e_1_3_2_1_19_2","unstructured":"R. Roth and G. Ruckenstein . Efficient decoding of reed-solomon codes beyond h~lf the minimum distance . In Prceedings of 1998 EIII International Symposium on Information Theory, p~ges 56-56 , 1998 . R. Roth and G. Ruckenstein. Efficient decoding of reed-solomon codes beyond h~lf the minimum distance. In Prceedings of 1998 EIII International Symposium on Information Theory, p~ges 56-56, 1998."},{"key":"e_1_3_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.476240"},{"key":"e_1_3_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276753"},{"key":"e_1_3_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_1_23_2","first-page":"633","article-title":"Error correction for algebraic block codes","volume":"4","author":"Welch L.R.","year":"1986","unstructured":"L.R. Welch and E.R. Berlekamp . Error correction for algebraic block codes . U.S. Patent 4 , 633 ,470, issued Dec. 30, 1986 . L.R. Welch and E.R. Berlekamp. Error correction for algebraic block codes. U.S. Patent 4,633,470, issued Dec. 30, 1986.","journal-title":"U.S. Patent"}],"event":{"name":"STOC99: ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Atlanta Georgia USA","acronym":"STOC99"},"container-title":["Proceedings of the thirty-first annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/301250.301311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T14:55:39Z","timestamp":1673448939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/301250.301311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":22,"alternative-id":["10.1145\/301250.301311","10.1145\/301250"],"URL":"https:\/\/doi.org\/10.1145\/301250.301311","relation":{},"subject":[],"published":{"date-parts":[[1999,5]]},"assertion":[{"value":"1999-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
