2 problems

Let $n$, $k$, $d$, and $t$ be integers such that $n-1\geq d\geq k\geq 2$ and $d\leq t(d-k+1)$. Let … The main theorem establishes that, when $\alpha\leq 3003$, there exists an…

Let ${\cal M}$ be the file size, and let $b$, $\rho$, $\sigma$, $k$, $d$, and $k_c$ be the block-failure resilient coding parameters. Assume $d_r\geq k_c$ and $\sigma>\rho$. BFR-MSR a…