排序方式: 共有11条查询结果,搜索用时 46 毫秒
1.
Abstract. Identifying codes in the square lattice are considered. The motivation for these codes is the following: if a multiprocessor
system is modelled by the square lattice, then we can locate faulty processors in the system with the aid of identifying codes.
Constructions, some of which are optimal, are given. 相似文献
2.
Abstract. Identifying codes in the square lattice are considered. The motivation for these codes is the following: if a multiprocessor
system is modelled by the square lattice, then we can locate faulty processors in the system with the aid of identifying codes.
Constructions, some of which are optimal, are given. 相似文献
3.
A code
is called (t, 2)-identifying if for all the words x, y(x y) and
the sets (B
t
(x) B
t
(y)) C and
are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of
-identifying codes and introduce weakly identifying codes. 相似文献
4.
5.
Tero Laihonen 《Graphs and Combinatorics》2006,22(4):487-496
Locating faulty processors in a multiprocessor system gives a motivation for identifying codes. The concept of a t-edge-robust r-identifying code was introduced in [8]. We consider these codes in the king lattice and give several optimal densities.
Research supported by the Academy of Finland under grants 207303 and 111940. 相似文献
6.
Designs, Codes and Cryptography - In this article, we study locating-dominating codes in binary Hamming spaces $$\mathbb {F}^n$$ . Locating-dominating codes have been widely studied since their... 相似文献
7.
8.
Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1], r-locating–dominating codes in paths Pn. They conjectured that if r≥2 is a fixed integer, then the smallest cardinality of an r-locating–dominating code in Pn, denoted by , satisfies for infinitely many values of n. We prove that this conjecture holds. In fact, we show a stronger result saying that for any r≥3 we have for all n≥nr when nr is large enough. In addition, we solve a conjecture on location–domination with segments of even length in the infinite path. 相似文献
9.
Tero Laihonen 《Discrete Applied Mathematics》2006,154(17):2499-2510
Fault diagnosis of multiprocessor systems gives the motivation for robust identifying codes. We provide robust identifying codes for the square and king grids. Often we are able to find optimal such codes. 相似文献
10.
The concept of identifying codes in a graph was introduced by Karpovsky et?al. (in IEEE Trans Inf Theory 44(2):599–611, 1998). These codes have been studied in several types of graphs such as hypercubes, trees, the square grid, the triangular grid, cycles and paths. In this paper, we determine the optimal cardinalities of identifying codes in cycles and paths in the remaining open cases. 相似文献