中文

一种具有高码率、低子分组化水平、小域大小且$d< (n-1)$的显式耦合层再生码构造

信息论 2022-04-07 v3 math.IT

摘要

本文提出了一种再生码(RGC)的显式构造,参数为 ((n=2qt,k=2q(t1),d=n(q+1)),(α=q(2q)t1,β=αq))((n=2qt,k=2q(t-1),d=n-(q+1)), (\alpha = q(2q)^{t-1},\beta = \frac{\alpha}{q})),定义在域 FQ\mathbb{F}_Q 上,码率 t2t\geq \frac{t-2}{t}。该RGC码可构造为具有任意接近11的码率 k/nk/n,子分组化水平 αrnr\alpha \leq r^{\frac{n}{r}}(其中 r=(nk)r=(n-k)),域大小 QQ 不大于 nn,且所有码符号均能以相同的最小数据下载量进行修复。

关键词

引用

@article{arxiv.1701.07447,
  title  = {An Explicit, Coupled-Layer Construction of a High-Rate Regenerating Code with Low Sub-Packetization Level, Small Field Size and $d< (n-1)$},
  author = {Birenjith Sasidharan and Myna Vajha and P. Vijay Kumar},
  journal= {arXiv preprint arXiv:1701.07447},
  year   = {2022}
}

备注

In the revised version, a correction is made in the rate calculation. The rate reduces and the code fails to be an MSR code. arXiv admin note: text overlap with arXiv:1607.07335