Analog random coding

We investigate numerically the “analog random coding” problem, where a vector x∈RNx∈RN, encrypted by an N by M random matrix W  , is transmitted to a remote receiver, over a noisy channel. We show that for M≫NM≫N, it is in fact possible to recover the original signal with very high accuracy, even for an extremely high level of noise.