暂无分享,去创建一个
[1] F. Moore,et al. Polynomial Codes Over Certain Finite Fields , 2017 .
[2] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[3] Shu Lin,et al. Polynomial codes , 1968, IEEE Trans. Inf. Theory.
[4] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[5] Elwyn R. Berlekamp. Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.
[6] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[7] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[8] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2011, STOC '11.
[9] Michael Alekhnovich. Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes , 2005, IEEE Trans. Inf. Theory.
[10] Swastik Kopparty. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[11] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[12] Prasad Raghavendra,et al. List Decoding Tensor Products and Interleaved Codes , 2011, SIAM J. Comput..
[13] Swastik Kopparty,et al. Decoding Reed-Muller Codes over Product Sets , 2017, Theory Comput..
[14] Prasad Raghavendra,et al. List decoding tensor products and interleaved codes , 2008, STOC '09.
[15] Michael Alekhnovich. Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes , 2005, IEEE Transactions on Information Theory.
[16] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[17] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[18] Raymond J. Nelson. Review: D. E. Muller, Application of Boolean Algebra to Switching Circuit Design and to Error Detection , 1955 .
[19] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[20] W. W. Peterson,et al. Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.
[21] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[22] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[23] Jehoshua Bruck,et al. A Combinatorial Bound on the List Size , 2004 .
[24] Ron M. Roth,et al. Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.
[25] Venkatesan Guruswami,et al. Decoding concatenated codes using soft information , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[26] Xin-Wen Wu,et al. List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.