Capacity achieving codes from randomness conductors

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2639-2643

  Cheraghchi, Mahdi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; CHANGE OF BASIS; ERROR PROBABILITIES; EXPLICIT CONSTRUCTIONS; LINEAR CODES; LINEAR TIME; LOSSLESS; QUADRATIC TIME; QUASI-POLY-NOMIAL; RANDOM CODES; RANDOMNESS EXTRACTORS; SYMMETRIC CHANNELS; THEORETICAL COMPUTER SCIENCE;

BINARY CODES; PROBABILITY;

INFORMATION THEORY;

EID: 70449516511     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205931     Document Type: Conference Paper

References (15)

1. C. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, 1948.
2. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge Univ. Press, 2008.
3. R. Blahut, Theory and Practice of Error Control Codes. Addison-Wesley, 1983.
4. A. Shokrollahi, "Raptor codes," IEEE Trans. Information Theory, vol. 52, pp. 2551-2567, 2006.
5. G. Forney, Concatenated Codes. MIT Press, 1966.
6. J. Justesen, "A class of constructive asymptotically good algebraic codes," IEEE Trans. Information Theory, vol. 18, pp. 652-656, 1972.
7. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," 2008, unpublished manuscript (arXiv: cs.IT/0807.3917).
8. R. Roth, Introduction to Coding Theory. Cambridge Univ. Press, 2006.
9. J. H. v. Lint, Introduction to Coding Theory. Springer, 1998.
10. R. Impagliazzo, L. Levin, and M. Luby, "Pseudorandom generation from one-way functions," in Proc. 21st STOC, 1989, pp. 12-24.
11. L. Trevisan, "Extractors and pseudorandom generators," JACM, vol. 48, no. 4, pp. 860-879, 2001.
12. R. Raz, O. Reingold, and S. Vadhan, "Extracting all the randomness and reducing the error in Trevisan's extractor," JCSS, vol. 65, no. 1, pp. 97-128, 2002.
13. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, "Randomness conductors and constant-degree expansion beyond the degree/2 barrier," in Proc. 34th STOC, 2002, pp. 659-668.
14. D. Spielman, "Linear-time encodable and decodable error-correcting codes," IEEE Trans. Inf. Th., vol. 42, pp. 1723-1731, 1996.
15. V. Guruswami and P. Indyk, "Linear-time encodable/decodable codes with near-optimal rate," IEEE Trans. Information Theory, vol. 51, no. 10, pp. 3393-3400, 2005.