Refined Coding Bounds and Code Constructions for Coherent Network Error Correction

Details Refined Coding Bounds and Code Constructions for Coherent Network Error Correction Refined Coding Bounds and Code Constructions for Coherent Network Error Correction

2009-04-13

arxiv.org/abs/0904.1897v2

Computer Science

Information Theory

32 pages

Scientific paper

Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set of local encoding kernels defining a linear network code, we obtain refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for coherent network error correction. Similar to its classical counterpart, this refined Singleton bound is tight for linear network codes. The tightness of this refined bound is shown by two construction algorithms of linear network codes achieving this bound. These two algorithms illustrate different design methods: one makes use of existing network coding algorithms for error-free transmission and the other makes use of classical error-correcting codes. The implication of the tightness of the refined Singleton bound is that the sink nodes with higher maximum flow values can have higher error correction capabilities.

Affiliated with

Also associated with

No associations

Rating

Refined Coding Bounds and Code Constructions for Coherent Network Error Correction 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 Refined Coding Bounds and Code Constructions for Coherent Network Error Correction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refined Coding Bounds and Code Constructions for Coherent Network Error Correction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323905