Decoding of Interleaved Reed Solomon Codes over Noisy Data
暂无分享,去创建一个
[1] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[2] Elwyn R. Berlekamp. Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.
[3] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[4] Paul C. van Oorschot,et al. An Introduction to Error Correcting Codes with Applications , 1989 .
[5] Madhu Sudan,et al. Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.
[6] Hugo Krawczyk. Distributed fingerprints and secure information dispersal , 1993, PODC '93.
[7] Aggelos Kiayias,et al. Secure Games with Polynomial Expressions , 2001, ICALP.
[8] 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).
[9] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[10] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[11] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .