In PLEB generating random permutations and sorting the bit vectors of size k involves worse preprocessing time than using IRP.
spending more time in pre-processing leads to finding better approximate nearest neighbors.