Capacity achieving codes From randomness conductors
暂无分享,去创建一个
[1] Yuan Zhou. Introduction to Coding Theory , 2010 .
[2] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[3] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[4] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[5] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[6] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[7] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[8] J. H. van Lint,et al. Introduction to Coding Theory , 1982 .
[9] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[10] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[11] 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.
[12] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[13] R. Blahut. Theory and practice of error control codes , 1983 .
[14] Ron M. Roth,et al. Introduction to Coding Theory , 2019, Discrete Mathematics.
[15] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[16] Thomas Holenstein,et al. Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness , 2006, TCC.
[17] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .