Bicomplex signals with sparsity constraints

In this paper, we aim to prove the possibility to reconstruct a bicomplex sparse signal, with high probability, from a reduced number of bicomplex random samples. Due to the idempotent representation of the bicomplex algebra, this case is similar to the case of the standard Fourier basis, thus allowing us to adapt in a rather easy way the arguments from the recent works of Rauhut and Candés et al.