Decoding Reed Solomon Codes beyond the Error-Correction Diameter
暂无分享,去创建一个
[1] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[3] Erich Kaltofen,et al. A polynomial-time reduction from bivariate to univariate integral polynomial factorization , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[4] D. Grigor'ev,et al. Factorization of polynomials over a finite field and the solution of systems of algebraic equations , 1986 .
[5] Erich Kaltofen,et al. Polynomial Factorization 1987-1991 , 1992, LATIN.
[6] Elwyn R. Berlekamp,et al. Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.
[7] Alexander Vardy,et al. Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.
[8] Ronitt Rubinfeld,et al. Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..