We prove Lemma REF  in Subsection REF  by showing that random LDPC codes are smooth.
We prove Lemma REF  in Section  using the known constructions of Ramanujan graphs by Lubotzky, Samuels and Vishne [1]} and Morgenstern [2]}.
