# What is the tightest known bound on the reconstruction error in compressed sensing?

I am specifically thinking about the reconstruction error of L1-minimization from compressed measurements with noise. I know a bound from (8) in The restricted isometry property and its implications for compressed sensing, but I was wondering if there is anything newer and or tighter that I am not aware of. Additionally, I would like to relate $\delta_{2s}$ to the size of e.g. a Gaussian measurement matrix. It seems I can do that from Lemma 3.1 and (3.22) in Decoding by linear programming, but how tight is (3.22) and can I get closer?