Year: 2006
Type: article
Abstract: In Part I of this paper, we introduced the paradigm of network error correction as a generalization of classical link-by-link error correction.We also obtained the network generalizations of the Hamming bound and the Singleton bound in classical algebraic coding theory.In Part II, we prove the network generalization of the Gilbert-Varshamov bound and its enhancement.With the latter, we show that the tightness of the Singleton bound is preserved in the network setting.We also discuss the implication of the results in this paper.
Institutions: Xidian University, Chinese University of Hong Kong
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
Funder: Chinese University of Hong Kong
OpenAlex ID: W2014554046
