Personal tools



Jump to: navigation, search


Title The rank of random binary matrices and distributed storage applications
Author Paulo J S G Ferreira, Bruno Jesus, José M. N. Vieira, Armando J. Pinho
Journal IEEE Communications Letters
Volume 17
Number 1
Pages 151-154
Month January
Year 2013
DOI 10.1109/LCOMM.2012.120612.122169
Group (before 2015) Signal Processing Laboratory
Indexed by ISI Yes


Random binary matrices appear in a variety of signal processing and encoding problems. They play an important role in rateless codes and in distributed storage applications. This paper focuses on block angular matrices, a class of random rectangular binary matrices that are particularly suited to distributed storage applications. We address one of the key issues regarding binary random matrices in general, and block angular matrices in particular: the probability of obtaining a full rank matrix, when drawing uniformly at random from the set of binary matrices with compatible structure. This paper gives a closed-form expression for this probability, as well as some bounds and approximations.