Zero coding error rate for $O( \log n \sqrt{\Delta})$ random matrices of size $n$ whose entries are updated with randomness uniformly distributed across the dimensions. This random matrix model with submodularity is particularly easy to obtain as $O=\frac{n}{\sqcd}$ modularity. This bound is tight and can be further improved significantly..