Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
暂无分享,去创建一个
[1] Peter Elias,et al. Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.
[2] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[3] 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).
[4] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[5] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[6] Noga Alon,et al. Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.
[7] Richard A. Brualdi,et al. Greedy Codes , 1993, J. Comb. Theory, Ser. A.
[8] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[9] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.
[10] Elchanan Mossel,et al. On the complexity of approximating the VC dimension , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[11] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[12] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[13] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[14] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[15] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[16] 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).
[17] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.
[18] Marcos A. Kiwi. Testing and Weight Distributions of Dual Codes , 1997, Electron. Colloquium Comput. Complex..
[19] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[20] D. Sivakumar,et al. On membership comparable sets , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).
[21] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[22] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[23] Ravi Kumar,et al. Proofs, codes, and polynomial-time reducibilities , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[24] E. Berlekamp. Factoring polynomials over large finite fields* , 1971, SYMSAC '71.
[25] Ralf Koetter. On optimal weight assignmnents for multivariate interpolation list-decoding , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.
[26] J. Kuelbs. Probability on Banach spaces , 1978 .
[27] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[28] Jin-Yi Cai,et al. On the Hardness of Permanent , 1999, STACS.
[29] Venkatesan Guruswami,et al. Decoding concatenated codes using soft information , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[30] Amnon Ta-Shma,et al. Constructing Small-Bias Sets from Algebraic-Geometric Codes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[31] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[32] A. Rudra,et al. List decoding and property testing of error-correcting codes , 2007 .
[33] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[34] V. Wei,et al. Error-Correcting Codes for List Decoding , 1994 .