Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
暂无分享,去创建一个
[1] Piotr Indyk. List-decoding in Linear Time , 2002, Electron. Colloquium Comput. Complex..
[2] Gilles Zémor,et al. On expander codes , 2001, IEEE Trans. Inf. Theory.
[3] Tom Høholdt,et al. Decoding Reed-Solomon Codes Beyond Half the Minimum Distance , 2000 .
[4] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[5] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[6] Venkatesan Guruswami,et al. List decoding from erasures: bounds and code constructions , 2001, IEEE Trans. Inf. Theory.
[7] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[8] R. Roth,et al. Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[9] D. Spielman,et al. Computationally efficient error-correcting codes and holographic proofs , 1995 .
[10] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[11] Michael A. Tsfasman,et al. Modular curves and codes with a polynomial construction , 1984, IEEE Trans. Inf. Theory.
[12] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[13] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[14] Ba-Zhong Shen. A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate , 1993, IEEE Trans. Inf. Theory.
[15] Venkatesan Guruswami,et al. Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[16] M. Murty. Ramanujan Graphs , 1965 .
[17] D. Spielman,et al. Expander codes , 1996 .
[18] 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).
[19] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[20] Amin Shokrollahi,et al. List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.
[21] Alexander Barg,et al. Error exponents of expander codes , 2002, IEEE Trans. Inf. Theory.