The state of the art in compressed sensing uses sensing matrices which satisfy the restricted isometry property
(RIP). Unfortunately, the known deterministic RIP constructions fall short of the random constructions, which
are only valid with high probability. In this paper, we consider certain deterministic constructions and compare
different proof techniques that demonstrate RIP in the deterministic setting.