Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound

Authors:
Ryutaroh Matsumoto
Affiliations:
-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 4
Cited 2

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Separate network coding for private and common messages from one source to two sinks

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On metrics for error correction in network coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.