Construction algorithm for network error-correcting codes attaining the Singleton bound

Details Construction algorithm for network error-correcting codes attaining the Singleton bound Construction algorithm for network error-correcting codes attaining the Singleton bound

2006-10-20

arxiv.org/abs/cs/0610121v4

IEICE Trans. Fundamentals, vol. E90-A, no. 9, pp. 1729-1735, September 2007

Computer Science

Information Theory

To appear in IEICE Trans. Fundamentals (http://ietfec.oxfordjournals.org/), vol. E90-A, no. 9, Sept. 2007. LaTeX2e, 7 pages,

Scientific paper

10.1093/ietfec/e90-a.9.1729

We give a centralized deterministic algorithm for constructing linear network error-correcting codes that attain the Singleton bound of network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We give estimates on the time complexity and the required symbol size of the proposed algorithm. We also estimate the probability of a random choice of local encoding vectors by all intermediate nodes giving a network error-correcting codes attaining the Singleton bound. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.

Affiliated with

Also associated with

No associations

Rating

Construction algorithm for network error-correcting codes attaining the Singleton bound 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 Construction algorithm for network error-correcting codes attaining the Singleton bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction algorithm for network error-correcting codes attaining the Singleton bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361749