Results 261 to 270 of about 453,327 (300)

Connected Identifying Codes

IEEE Transactions on Information Theory, 2012
We consider the problem of generating a connected identifying code for an arbitrary graph. After a brief motivation, we show that the decision problem regarding the existence of such a code is NP-complete, and we propose a novel polynomial-time approximation ConnectID that transforms any identifying code into a connected version of at most twice the ...
Niloofar Fazlollahi, David Starobinski, Ari Trachtenberg   +2 more
openaire   +1 more source

Identifying the speech codes

Cognitive Psychology, 1980
Models of speech processing typically assume that speech is represented by a succession of codes. In this paper we argue for the psychological validity of a prelexical (phonetic) code and for a postlexical (phonological) code. Whereas phonetic codes are computed directly from an analysis of input acoustic information, phonological codes are derived ...
D J, Foss, M A, Blank
openaire   +2 more sources

Bounds on the Identifying Codes in Trees

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadi Rahbani, Nader Jafari Rad, Seyed Masoud Mirrezaei   +2 more
openaire   +2 more sources

On the Size of Identifying Codes

1999
A code is called t-identifying if the sets Bt(x) ∩ C are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length n are given.
Uri Blass, Iiro S. Honkala, Simon Litsyn
openaire   +1 more source

Identifying code

Nursing Standard, 1987
A new bar code printing system for identifying specimens used in blood, urine and tissue analysis has been introduced by Kelgray Products Ltd.
openaire   +2 more sources

A linear-time algorithm for the identifying code problem on block graphs [PDF]

Electronic Notes in Discrete Mathematics, 2017
International audienceThe identifying code problem is a special search problem, challenging both from a theoretical and a computational point of view, even for several graphs where other in general hard problems are easy to solve, like bipartite graphs ...
Gabriela R Argiroffo, Silvia M Bianchi, Annegret K Wagler   +2 more
exaly   +3 more sources

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

Progress on the description of identifying code polyhedra for some families of split graphs [PDF]

Discrete Optimization, 2016
International audienceThe identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs and split graphs.
Silvia Bianchi, Annegret K Wagler
exaly   +2 more sources

An optimal code for patient identifiers

Computer Methods and Programs in Biomedicine, 2005
How to distinguish 1 billion individuals by an identifier consisting of eight characters, allowing a reasonable amount of error detection or even error correction? Our solution of this problem is an optimal code over a 32-character alphabet that detects up to two errors and corrects one error as well as a transposition of two adjacent characters.
Andreas Faldum, Klaus Pommerening
openaire   +2 more sources

On robust and dynamic identifying codes

IEEE Transactions on Information Theory, 2006
A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u/spl isin/C:d(u,v)/spl les/1}, v/spl isin/V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly
Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin   +2 more
openaire   +1 more source