7 problems

In the fixed-size access model, let $N$ be the number of nodes, $m$ the redundancy level, $r$ the number of accessed nodes, and $b1$ the spreading parameter, with minimal spreading…

Let $m$ be the coded file size ratio, and let $\alpha$ be the allocation parameter maximizing the average service rate $\mu_s(\alpha)$. The claim applies to both the fixed-size acc…

Let $p$ be the access failure probability for each node, let $\alpha$ be the allocation parameter, and let $\mu_s(\alpha)$ denote the average service rate under probabilistic acces…

Let $r$ denote the number of accessed nodes, let $\alpha$ be the allocation parameter, and let $\mu_s(\alpha)$ denote the average service rate under fixed-size access. Fixed-size a…

Let $\mathcal{C}$ be an $[n,k]$ code, and let $d_s^{\mathcal{C}}$ denote the quantity appearing in the necessary condition … An MDS-PIR capacity-achieving matrix…

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…

An allocation distributes storage across $n$ nodes, and its recovery delay is denoted by $D$; the parameters are the node count $n$, request rate $\lambda$, and threshold $T$. An a…