Randomness conductors and constant-degree lossless expanders
Authors:
Open Access
- 19 May 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 659-668
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Extractors and pseudorandom generatorsJournal of the ACM, 2001
- Short proofs are narrow—resolution made simpleJournal of the ACM, 2001
- Improved low-density parity-check codes using irregular graphsIEEE Transactions on Information Theory, 2001
- Expander codesIEEE Transactions on Information Theory, 1996
- Linear-time encodable and decodable error-correcting codesIEEE Transactions on Information Theory, 1996
- Randomness is Linear in SpaceJournal of Computer and System Sciences, 1996
- Eigenvalues and expansion of regular graphsJournal of the ACM, 1995
- Many hard examples for resolutionJournal of the ACM, 1988
- Hard examples for resolutionJournal of the ACM, 1987
- How to share memory in a distributed systemJournal of the ACM, 1987