AN ALGORITHM TO RECOVER SHREDDED RANDOM MATRICES

Given some binary matrix M , suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, can we recover the unique original orderings and matrix? We present an algorithm that identifies whether there is a unique ordering associated with a set of rows and columns, and outputs either the unique correct orderings for the rows and columns or the full collection of all valid orderings and valid matrices. We show that there is a constant c > 0 such that the algorithm terminates in O(n(2)) time with high probability and in expectation for random n \times n binary matrices with i.i.d. entries (m(ij))(ij =1)(n) such that P(m(ij) = 1) = p and c log(2) (n)/n (log log(n))(2) <= p <= 1/2 .