Gruica et al. recovery-balance duality conjecture
Let be a linear code, let be a generator matrix for with columns , and, for each coordinate , let be the number of independent uniformly random samples with replacement from required until lies in the span of the columns sampled so far. Define to be recovery balanced if is independent of . The recovery-balance duality conjecture asserts that, for every linear code , is recovery balanced if and only if its dual code is recovery balanced.
References
- A Matroidal Framework for Random Access in Linear Codes — arXiv — Daniella Bar-Lev, Hiram H. López, Gretchen L. Matthews, Flavio Salizzoni
Source: arXiv
Progress summary
An October 2026 preprint claims to prove the recovery-balance duality conjecture, but the result has not been independently checked.
Gruica et al. conjectured that recovery balance for a linear code is equivalent to recovery balance for its dual. The conjecture is stronger than the earlier result for codes with transitive symmetry.
Known results
- Codes with a transitive permutation automorphism group, and their duals, are recovery balanced (Gruica et al.).
October 2026 claimed proof
Bar-Lev, López, Matthews, and Salizzoni claim that the associated matroid proves the duality equivalence and extends the result to arbitrary matroids. The claim appears in an unrefereed preprint and has no independent mathematical confirmation in the retrieved sources.
Current status (as of October 2026): A preprint claims the conjecture is solved, but the proof remains unverified; absent confirmation, the conjecture is not established.
Solutions 0
No solutions have been posted yet.