4 problems

Consider the consecutive and symmetric embedded index coding problems studied in the paper, and let the normalized rate denote the number of transmitted bits normalized by the tota…

Sub-packetization rate conjecture. The normalized rate achieved by the sub-packetization scheme is lower than $\frac{N-s+1}{N}$, the normalized rate achieved using a scalar linear…

Let $[n,k]$ denote a Reed–Solomon code with an $\epsilon$-MSR repair scheme, meaning that the repair bandwidth for every single failed node is at most $(1+\epsilon)$ times the cut-…

Let $k$ be the number of systematic nodes, let $r$ be the number of parity nodes, and let $\ell$ be the sub-packetization level of an MSR code. The construction in WTB12 has sub-pa…