Capacity Achieving Codes From Randomness Condensers
暂无分享,去创建一个
[1] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[2] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[3] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[4] Ron M. Roth,et al. Introduction to Coding Theory , 2019, Discrete Mathematics.
[5] Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.
[6] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[7] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[8] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[9] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[10] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[11] J.L. Massey,et al. Theory and practice of error control codes , 1986, Proceedings of the IEEE.
[12] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[13] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[14] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[15] Venkatesan Guruswami,et al. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes , 2009, JACM.