3,210 research outputs found
Construction algorithm for network error-correcting codes attaining the Singleton bound
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.Comment: To appear in IEICE Trans. Fundamentals
(http://ietfec.oxfordjournals.org/), vol. E90-A, no. 9, Sept. 2007. LaTeX2e,
7 pages, using ieice.cls and pstricks.sty. Version 4 adds randomized
construction of network error-correcting codes, comparisons of the proposed
methods to the existing methods, additional explanations in the proo
Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
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.Comment: 32 page
- …