An Explicit, Coupled-Layer Construction of a High-Rate Regenerating Code with Low Sub-Packetization Level, Small Field Size and $d< (n-1)$

This paper presents an explicit construction for an $((n=2qt,k=2q(t-1),d=n-(q+1)), (α= q(2q)^{t-1},β= \fracα{q}))$ regenerating code (RGC) over a field $\mathbb{F}_Q$ having rate $\geq \frac{t-2}{t}$. The RGC code can be constructed to have rate $k/n$ as close to $1$ as desired, sub-packetization level $α\leq r^{\frac{n}{r}}$ for $r=(n-k)$, field size $Q$ no larger than $n$ and where all code symbols can be repaired with the same minimum data download.

No reviews yet.

No comments yet.