Results 231 to 240 of about 251,062 (259)

Sphere coverings and identifying codes

Designs, Codes and Cryptography, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Auger, Gérard D. Cohen, Sihem Mesnager   +2 more
openaire   +1 more source

Robust parent-identifying codes

2010 IEEE Information Theory Workshop, 2010
Codes with the identifiable parent property (IPP codes) are used in traitor tracing schemes that protect data broadcast by the publisher from unauthorized access or distribution. An n-word y over a finite alphabet is called a descendant of a set of t words x1, …, xt if y i ∊ {x1 i , …, xt i } for all i = 1, … n.
Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier   +3 more
openaire   +1 more source

Identifying codes in random networks

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
In this paper we deal with codes identifying sets of vertices in random graphs, that is l-identifying codes. These codes enable us to detect sets of faulty processors in a multiprocessor system, assuming that the maximum number of faulty processors is bounded by a fixed constant l.
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth 0001   +4 more
openaire   +1 more source

On the Quality of Identifiers in Test Code

2019 19th International Working Conference on Source Code Analysis and Manipulation (SCAM), 2019
Meaningful, expressive identifiers in source code can enhance the readability and reduce comprehension efforts. Over the past years, researchers have devoted considerable effort to understanding and improving the naming quality of identifiers in source code.
Bin Lin 0008, Csaba Nagy 0001, Gabriele Bavota, Andrian Marcus, Michele Lanza 0001   +4 more
openaire   +1 more source

On identifying codes in the hexagonal mesh

Information Processing Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iiro S. Honkala, Tero Laihonen
openaire   +2 more sources

1-identifying codes on trees [PDF]

Australas. J Comb., 2005
Summary: Consider a connected undirected graph \(G=(V,E)\), a subset of vertices \(C \subseteq V\), and an integer \(r\geq 1\); for any vertex \(v\in V\), let \(B_r(v)\) denote the ball of radius \(r\) centered at \(v\), i.e., the set of all vertices within distance \(r\) from \(v\).
Nathalie Bertrand 0001, Irène Charon, Olivier Hudry, Antoine Lobstein   +3 more
openaire   +1 more source

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

On identifying codes

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

Identifying Code-switching in Arabizi

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