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

线性编码率对有限域特征的依赖性

On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field

Niladri Das, Brijesh Kumar Rai

摘要:

已知对于任意有限/余有限素数集,存在一个网络有速率$1$解当且仅当有限域的特征属于给定的集合。我们推广了这一结果,证明了对任意正有理数$k/n$,以及任意给定的素数的有限/余有限集合,存在一个网络,它具有速率$k/n$分数线性网络编码解当且仅当有限域的特征属于给定集合.为此,我们构造了两个网络:$\mathcal{N}_1$和$\mathcal{N}_2$ ;网络$\mathcal{N}_1$具有$k/n$分数线性网络编码解当且仅当有限域的特征属于给定的有限素数集,网络$\mathcal{N}_2$具有$k/n$分数线性网络编码解当且仅当有限域的特征属于给定的有限素数集。最近,一种方法已被引入,其中特征依赖的线性秩不等式产生的网络的线性编码能力取决于有限域的特性。将此方法应用于网络$\mathcal{N}_1$和$\mathcal{N}_2$,构造了两类特征依赖的线性秩不等式.对于任何给定的素数集合,第一类包含一个不等式,如果有限域的特征不属于给定的素数集合,则该不等式成立,否则可能不成立;第二类包含一个不等式,如果有限域的特征属于给定的素数集合,则该不等式成立,否则可能不成立。然后,我们使用这些不等式,以获得上界的线性编码容量的$\mathcal{N}_1$和$\mathcal{N}_2$。

英文摘要:

It is known that for any finite/co-finite set of primes there exists a network which has a rate $1$ solution if and only if the characteristic of the finite field belongs to the given set. We generalize this result to show that for any positive rational number $k/n$, and for any given finite/co-finite set of primes, there exists a network which has a rate $k/n$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to the given set. For this purpose we construct two networks: $\mathcal{N}_1$ and $\mathcal{N}_2$; the network $\mathcal{N}_1$ has a $k/n$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to the given finite set of primes, and the network $\mathcal{N}_2$ has a $k/n$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to the given co-finite set of primes. Recently, a method has been introduced where characteristic-dependent linear rank inequalities are produced from networks whose linear coding capacity depends on the characteristic of the finite field. By employing this method on the networks $\mathcal{N}_1$ and $\mathcal{N}_2$, we construct two classes of characteristic-dependent linear rank inequalities. For any given set of primes, the first class contains an inequality which holds if the characteristic of the finite field does not belong to the given set of primes but may not hold otherwise; the second class contains an inequality which holds if the characteristic of the finite field belongs to the given set of primes but may not hold otherwise. We then use these inequalities to obtain an upper-bound on the linear coding capacity of $\mathcal{N}_1$ and $\mathcal{N}_2$.

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

↑