منابع مشابه
Network Error Correction, Part Ii: Lower Bounds
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 ...
متن کاملNetwork Error Correction, Part I: Basic Concepts and Upper Bounds
Error correction in existing point-to-point communication networks is done on a link-by-link basis, which is referred to in this paper as classical error correction. Inspired by network coding, we introduce in this two-part paper a new paradigm called network error correction. The theory thus developed subsumes classical algebraic coding theory as a special case. In Part I, we discuss the basic...
متن کاملLower Bounds on Correction Networks
Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We show the lower bound 1.44log2 N on the depth of correction networks settling an open problem from [7]. This bound is tight since the upper bound 1.44log2 N is known.
متن کاملQuantum error detection II: Bounds
In Part I of this paper we formulated the problem of error detection with quantum codes on the completely depolarized channel and gave an expression for the probability of undetected error via the weight enumerators of the code. In this part we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this expo...
متن کاملTreewidth computations II. Lower bounds
For several applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast. Good lower bounds on the treewidth of a graph can, amongst others, help to speed up branch and bound algorithms that compute the treewidth of a graph exactly. A high lower bound for a specific graph instance can tell that a dynamic progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Information and Systems
سال: 2006
ISSN: 1526-7555,2163-4548
DOI: 10.4310/cis.2006.v6.n1.a3