Author:
Muralidhara V.N.,Sen Sandeep
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Qi Cheng, Daqing Wan, On the list and bounded distance decodability of Reed–Solomon codes (extended abstract), in: FOCS, 2004, pp. 335–341
2. L. Welch, E. Berlekamp, Error correction of algebraic block codes. US Patent Number 4633470, 1986. A description also appears in Peter Gemmell and Madhu Sudan, Highly Resilient Correctors for Polynomials Information Processing Letters 43 (4) (1992) 169–174
3. Peter Elias, List decoding for noisy channels, in: 1957-IRE WESCON Convention Record, 1957, pp. 94–104
4. Learning polynomials with queries: The highly noisy case;Goldreich;SIAM Journal on Discrete Mathematics,2000
5. Decoding Reed–Solomon codes beyond the error-correction bound;Sudan;Journal of Complexity,1997
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献