Results 271 to 280 of about 256,860 (287)

Codes Identifying Sets of Vertices

2001
We consider identifying and strongly identifying codes. Finding faulty processors in a multiprocessor system gives the motivation for these codes. Constructions and lower bounds on these codes are given.We provide two infinite families of optimal (1, ? 2)-identifying codes, which can find malfunctioning processors in a binary hypercube F2n.
Tero Laihonen, Sanna M. Ranto
openaire   +1 more source

Optimal linear identifying codes

IEEE Transactions on Information Theory, 2003
Summary: Identifying codes can be used to locate malfunctioning processors. We say that a code \(C\) of length \(n\) is a linear \((1,\leq l)\)-identifying code if it is a subspace of \(\mathbb{F}_2^n\) and for all \(X,Y\subseteq \mathbb{F}_2^n\) such that \(|X|, |Y|\leq l\) and \(X\neq Y\), we have \[ \bigcup_{x\in X}(B(x)\cap C)\neq \bigcup_{y\in Y ...
openaire   +2 more sources

Identifying Code-switching in Arabizi

Proceedings of the Seventh Arabic Natural Language Processing Workshop (WANLP), 2022
Safaa Shehadi, Shuly Wintner
openaire   +1 more source

On identifying codes

2001
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor   +3 more
openaire   +1 more source

Identifying Code for Directed Graph

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Yichun Xu, Renbin Xiao
openaire   +1 more source

Two families of optimal identifying codes in binary Hamming spaces

IEEE Transactions on Information Theory, 2002
Sanna Ranto, I S Honkala, Tero Laihonen   +2 more
exaly  

On Identifying Codes in Binary Hamming Spaces

Journal of Combinatorial Theory - Series A, 2002
Iiro Honkala, Antoine Lobstein
exaly  

Watching systems in graphs: An extension of identifying codes

Discrete Applied Mathematics, 2013
David Auger, Irène Charon, Olivier Hudry   +2 more
exaly  

Extremal cardinalities for identifying and locating-dominating codes in graphs

Discrete Mathematics, 2007
Irène Charon, Antoine Lobstein
exaly  

New upper bounds for parent-identifying codes and traceability codes

Designs, Codes, and Cryptography, 2017
Chong Shangguan, Gennian Ge, Ge Gennian   +2 more
exaly