arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.06426cs.ITmath.IT
收藏

关于广义扩展Blaum-Roth码

On Generalized Expanded Blaum-Roth Codes

Mario Blaum

摘要:

扩展Blaum-Roth(EBR)码由$n\times n$阵列组成,使得对于$2\leq r<n$的斜率线$i$、$0\leq i\leq r-1$以及垂直线具有偶奇偶性。这些代码是关于列的MDS,即,当且仅当$n$是素数时,它们可以恢复任何$r$擦除的列。最近,EBR码的一个推广,称为广义扩展Blaum-Roth(GEBR)码,被提出。GEBR码由$pτ\times (k+r)$阵列组成,其中$p$是素数,$τ\geq 1$是素数,使得斜率线$i$、$0\leq i\leq r-1$具有偶数奇偶性,并且阵列中的每一列在被视为多项式时是$1+x^τ$的倍数。特别地,当$p$是奇素数,2是$GF(p)$和$τ= p^j$,$j\geq 0$中的本原数时,由$pτ\times (p-1)τ$阵列组成的GEBR码是MDS.我们进一步推广了这个结果,证明了由$pτ\times pτ$阵列组成的GEBR码是MDS当且仅当$τ= p^j$,其中$0\leq j$和$p$是任意奇素数.

英文摘要:

Expanded Blaum-Roth (EBR) codes consist of $n\times n$ arrays such that lines of slopes $i$, $0\leq i\leq r-1$ for $2\leq r<n$, as well as vertical lines, have even parity. The codes are MDS with respect to columns, i.e., they can recover any $r$ erased columns, if and only if $n$ is a prime number. Recently a generalization of EBR codes, called generalized expanded Blaum-Roth (GEBR) codes, was presented. GEBR codes consist of $pτ\times (k+r)$ arrays, where $p$ is prime and $τ\geq 1$, such that lines of slopes $i$, $0\leq i\leq r-1$, have even parity and every column in the array, when regarded as a polynomial, is a multiple of $1+x^τ$. In particular, it was shown that when $p$ is an odd prime number, 2 is primitive in $GF(p)$ and $τ= p^j$, $j\geq 0$, the GEBR code consisting of $pτ\times (p-1)τ$ arrays is MDS. We extend this result further by proving that GEBR codes consisting of $pτ\times pτ$ arrays are MDS if and only if $τ= p^j$, where $0\leq j$ and $p$ is any odd prime.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑