Results 41 to 50 of about 256,860 (287)
Intersecting codes and partially identifying codes
Electronic Notes in Discrete Mathematics, 2001 Abstract Let τ be a code of length n. Then x is called a descendant of the coalition of codewords a, b, …, ei fxi ∈ {ai, bi…, ei} for i = 1,…, n. We study codes with the following property: any two non intersecting coalitions of a limited size have no common descendant. We present constructions based on linear intersecting codes.
Gérard D. Cohen +2 more
openaire +1 more source
On Codes with the Identifiable Parent Property
Journal of Combinatorial Theory, Series A, 1998 Suppose \(C\) is a code of length \(n\) over an alphabet \(Q\) containing \(q\) elements and let \(a\) and \(b\) be any two codewords. Then \(c\) is a decendent of \(a\) and \(b\) if \(c_i\) is in \((a_i,b_i)\), for \(i= 1,2,\dots, n\). The authors are interested in codes \(C\) such that given any decendent \(c\), one of the ``parent'' codewords in \(C\
Henk D. L. Hollmann +3 more
openaire +3 more sources
Error-correcting Identifying Codes
CoRR, 2022 Assume that a graph $G$ models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a subset of vertices in $G$ to automatically determine if there is an intruder, and if so, its precise location.
Devin C. Jean, Suk Jai Seo
openaire +2 more sources
Cancer Informatics, 2007 Background Large linked databases (LLDB) represent a novel resource for cancer outcomes research. However, accurate means of identifying a patient population of interest within these LLDBs can be challenging.
Michael Graiser +6 more
doaj +2 more sources
Improved bounds on identifying codes in binary Hamming spaces [PDF]
, 2010 Let ℓ, n and r be positive integers. Define Fn={0,1}n. The Hamming distance between words x and y of Fn is denoted by d(x,y). The ball of radius r is defined as Br(X)={y∈Fn∣∃x∈X:d(x,y)≤r}, where X is a subset of Fn.
Laihonen, Tero +3 more
core +1 more source
Identifying cultural codes of students in order to develop advert messages
Вестник Российского экономического университета имени Г. В. Плеханова, 2019 Today it is necessary to improve effectiveness of advert messages used in advertising campaign of entrance exams at the Russian Plekhanov University of Economics.
S. A. Afonsky
doaj +1 more source
Polyhedra associated with identifying codes in graphs [PDF]
, 2018 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.
Wagler, Annegret Katrin +14 more
core +1 more source
On the size of identifying codes in binary hypercubes [PDF]
, 2009 In this paper, we consider identifying codes in binary Hamming spaces Fn, i.e., in binary hypercubes. The concept of (r,⩽ℓ)-identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998.
Janson, Svante, +4 more
core +1 more source
Bounds on r-identifying codes in q-ary Lee space [PDF]
, 2021 Identifying codes are used to locate malfunctioning processors in multiprocessor systems. In this paper, we study identifying codes in a $q$-ary hypercube which is used in parallel processing.
Durairajan, Chinnapillai +1 more
core +2 more sources
A fast method for blindly identifying Reed‐Solomon codes based on matrix analysis
IET Communications, 2022 For the identification of Reed‐Solomon (RS) codes, the existing methods need to test the possible codeword length and the primitive polynomials exhaustively. Exhaustive search leads to high computational complexity.
Shunan Han +3 more
doaj +1 more source