Full-rank conjecture for regular and irregular banded random binary matrices

From papers

Let n,k,αn,k,\alpha and γ\gamma be integers with knk\leq n and γ<α\gamma<\alpha. Let MM be a (γ,α)(\gamma,\alpha) regular or irregular symmetric or asymmetric banded random matrix of size n×kn\times k. Its rank over the binary field is denoted by r(M)r(M); the parameters satisfy γ=α/τe\gamma=\alpha/\tau_e and τe=τ/(τ1)\tau_e=\tau/(\tau-1), where τ\tau is any constant divisor of α\alpha. Full-rank conjecture. For any ϵ>0\epsilon>0 and sufficiently large kk,

Pr[r(M)<k]ϵ,\Pr[r(M)<k]\leq\epsilon,

provided knlog(1/ϵ)k\leq n-\log(1/\epsilon) and either γ2k\gamma\geq 2\sqrt{k} or γτeτk\gamma\geq\tau_e\tau\sqrt{k}, respectively. This conjecture concerns the rank behavior of two general classes of banded random binary matrices, extending a prior result for a subclass of symmetric banded matrices; its resolution would establish that these matrices are full rank with high probability under the stated overlap conditions.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Anoosheh Heidarzadeh and Amir H. Banihashemi, “Analysis of Overlapped Chunked Codes with Small Chunks over Line Networks”, arXiv:1105.6288 (2011).

Solutions 0

No solutions have been posted yet.