Network-Error Correcting Codes using Small Fields

Details Network-Error Correcting Codes using Small Fields Network-Error Correcting Codes using Small Fields

2010-09-20

arxiv.org/abs/1009.3728v1

Computer Science

Information Theory

Scientific paper

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. 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. 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. Our secondary contribution is to modify the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.

Affiliated with

Also associated with

No associations

Rating

Network-Error Correcting Codes using Small Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Network-Error Correcting Codes using Small Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network-Error Correcting Codes using Small Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263936