Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/314613.314646acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article
Free access

Reconstructing randomly sampled multivariate polynomials from highly noisy data

Published: 01 January 1998 Publication History
First page of PDF

References

[1]
S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, Reconstructing algebraic functions from mixed data, Proc. 33rd IEEE FOCS, pp. 503-512, 1992.
[2]
E. Berlekamp and L. Welch, Error correction of algebraic block codes, US Patent #4633470, 1986.
[3]
P. Gemmell and M. Sudan, Highly resilient correctors for polynomials, Inform. Processing Letters, 43 (1992), pp. 169-174.
[4]
O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: the highly noisy case, Proc. 36th IEEE FOCS, pp. 294-303, 1995.
[5]
E. Kaltofen, Polynomial fac~orization 1987-1991, LATIN '92, Springer LNCS, 583 (1992), pp. 294- 313.
[6]
M. A. Shokrollahi and H. Wasserman, Decoding algebraic-geometric codes beyond the errorcorrection bound, to be presented at 35th Allerton Conf. Communication, Control, and Computing, 1997, and Int'l IEEE Inform. Theory Workshop, 1998. Available at: http.cs.berkeley.edu/~halw/ goppa.ps
[7]
M. Sudan, Maximum likelihood decoding of Reed Solomon codes, Proc. 37th IEEE FOCS, pp. 164- 172, 1996.
[8]
M. Sudan, Decoding of Reed Solomon codes beyond the error-correction bound, J. Compl., 13 (1997), pp. 180-193.

Cited By

View all
  • (2001)Sparse polynomial approximation in finite fieldsProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380803(209-215)Online publication date: 6-Jul-2001
  • (1998)Decoding algebraic-geometric codes beyond the error-correction boundProceedings of the thirtieth annual ACM symposium on Theory of computing10.1145/276698.276753(241-248)Online publication date: 23-May-1998

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
January 1998
704 pages
ISBN:0898714109

Sponsors

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

  • Article

Conference

SODA98
Sponsor:
SODA98: 1998 Conference on Discrete Algorithms
January 25 - 27, 1998
California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)47
  • Downloads (Last 6 weeks)8
Reflects downloads up to 25 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2001)Sparse polynomial approximation in finite fieldsProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380803(209-215)Online publication date: 6-Jul-2001
  • (1998)Decoding algebraic-geometric codes beyond the error-correction boundProceedings of the thirtieth annual ACM symposium on Theory of computing10.1145/276698.276753(241-248)Online publication date: 23-May-1998

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media