Related references
Note: Only part of the references are listed.The Minimum Distance of Turbo-Like Codes
Louay Bazzi et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2009)
Endcoding complexity versus minimum distance
LMJ Bazzi et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
The complexity of constructing pseudorandom generators from hard functions
E Viola
COMPUTATIONAL COMPLEXITY (2005)
Are bitvectors optimal?
H Buhrman et al.
SIAM JOURNAL ON COMPUTING (2002)
Bounds for dispersers, extractors, and depth-two superconcentrators
J Radhakrishnan et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2000)
Share Paper
