List decoding from erasures: bounds and code constructions
暂无分享,去创建一个
[1] Ron M. Roth,et al. Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.
[2] Peter Elias,et al. List decoding for noisy channels , 1957 .
[3] Peter Elias,et al. Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.
[4] Vladimir M. Blinovsky,et al. List decoding , 1992, Discrete Mathematics.
[5] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[6] Tom Høholdt,et al. Decoding Reed-Solomon Codes Beyond Half the Minimum Distance , 2000 .
[7] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[8] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[9] Richard J. Lipton,et al. Computing from partial solutions , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[10] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[11] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[12] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[13] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.