Appendices A Bernoulli-CRS Properties Let us define K R

First, we show that the above holds in expectation: Proposition 1. E null A Its expectation is controlled through the parameter k: Proposition 2. E [T ] = k . Let us further derive the properties of the proposed sampling algorithm. For notation simplicity, we assume zero padding. This formulation immediately hints at the possibility to sample over the input channel dimension, similarly to sampling column-row pairs in matrices. Figure 2 illustrates the sampling operation.