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

Simple item page
dc.creatorMatsumoto, Ryutaroh
dc.date2006-10-20
dc.date2007-05-09
dc.date.accessioned2026-07-07T08:27:19Z
dc.date.available2026-07-07T08:27:19Z
dc.descriptionWe 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.
dc.descriptionTo 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 proof
dc.identifierhttps://arxiv.org/abs/cs/0610121
dc.identifierhttp://arxiv.org/abs/cs/0610121
dc.identifierIEICE Trans. Fundamentals, vol. E90-A, no. 9, pp. 1729-1735, September 2007
dc.identifierdoi:10.1093/ietfec/e90-a.9.1729
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137232
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectNetworking and Internet Architecture
dc.subjectC.2.1; E.1; E.4; G.2.2
dc.titleConstruction algorithm for network error-correcting codes attaining the Singleton bound
dc.typetext

Files

Collections

arXiv