3 problems

Smallest $(r,r-1)$ -erasure correcting set conjecture
For each $r\geq 2$ , let $A_{r,r-1}$ be the explicitly constructed $(r,r-1)$ -erasure correcting set, and let $F(r,r-1)$ be the minimum cardinality of any such set. Smallest-set conj…
opencoding-theory erasure-correction
0 responses
03
Song–Cai–Yue rate conjecture for sequentially recoverable locally recoverable codes
Song–Cai–Yue conjecture. An achievable upper bound on the rate $k/n$ is
opencoding-theory erasure-correction locally-recoverable-codes
0 responses
07
Regularity characterization conjecture for correctable patterns in tensor-product topologies
Regularity characterization conjecture. An erasure pattern $E$ is correctable for $T_{m\times n}(a,b,0)$ if and only if it is regular.
openerasure-correction error-correcting-codes tensor-product-codes
0 responses
04

Smallest (r,r−1)(r,r-1)(r,r−1)-erasure correcting set conjecture