arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1009.3728cs.ITmath.IT
收藏

网络-使用小字段的纠错码

Network-Error Correcting Codes using Small Fields

K. Prasad, B. Sundar Rajan

摘要:

现有的块网络-纠错码的构造算法需要相当大的字段大小,该字段大小随着网络的大小和接收器的数量而增长,从而在大型网络中可能是禁止的。本文给出了一种算法,它从一个给定的网络纠错码出发,用一个小的域得到另一个具有与原码相同纠错能力的网络码。Ebrahimi和Fragouli最近提出的一种使用小字段大小设计网络码的算法可以看作是我们算法的一个特例。算法的主要步骤是寻找一个与另一个大次数多项式互质的最小次数不可约多项式。我们利用有限域的代数性质来实现这一步,使它变得比蛮力方法快得多。从而也加快了Ebrahimi和Fragouli给出的算法。

英文摘要:

Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. In this work, we give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. An algorithm for designing network codes using small field sizes proposed recently by Ebrahimi and Fragouli can be seen as a special case of our algorithm. The major step in our algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We utilize the algebraic properties of finite fields to implement this step so that it becomes much faster than the brute-force method. As a result the algorithm given by Ebrahimi and Fragouli is also quickened.

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

↑