Constructions of r-identifying codes and (r, ≤ l)-identifying codes
R Dhanalakshmi, C Durairajan - Indian Journal of Pure and Applied …, 2019 - Springer
In binary Hamming space, we construct r-identifying codes from a ∑ i= 0^ r-1\left (n\cr
i\cr\right)+\left (n-1 r-1\cr\right)+ 1∑ i= 0 r− 1 (ni)+(n− 1 r− 1)+ 1-fold r-covering code. By …
i\cr\right)+\left (n-1 r-1\cr\right)+ 1∑ i= 0 r− 1 (ni)+(n− 1 r− 1)+ 1-fold r-covering code. By …
[PDF][PDF] SYSTEMES DE CONTRˆOLE, CODES IDENTIFIANTS, LOCALISATEURS-DOMINATEURS ET DISCRIMINANTS DANS LES GRAPHES
G COHEN, F MAFFRAY, Y MANOUSSAKIS, P SLATER - 2024 - dragazo.github.io
[7] GR Argiroffo, SM Bianchi, YP Lucarini, and AK Wagler. 2019. The identifying code, the
locating-dominating, the open locating-dominating and the locating total-dominating …
locating-dominating, the open locating-dominating and the locating total-dominating …
[PDF][PDF] In Memoriam Gérard COHEN, Faina SOLOV'EVA
A TIETAVAINEN, A VARDY - lri.fr
Warning and Public Call I intend to retire on March 1st, 2023. After this day, I will not go on
updating this bibliography. I do not know how long my site, and in particular this page, will …
updating this bibliography. I do not know how long my site, and in particular this page, will …
[PDF][PDF] In Memoriam Gérard COHEN, Frédéric MAFFRAY, Yannis MANOUSSAKIS
P SLATER - 2023 - lri.fr
March 14, 2023 Warning and Public Call I intend to retire on March 1st, 2023. After this day,
I will not go on updating this bib Page 1 In Memoriam Gérard COHEN, Frédéric MAFFRAY …
I will not go on updating this bib Page 1 In Memoriam Gérard COHEN, Frédéric MAFFRAY …
[PDF][PDF] Open problems in coding and cryptography
G Cohen - 2012 - 2012.cbc.pqcrypto.org
Memory is in state y∈ Fn Due to the constraints, only a subset A (y) of Fn is reachable from
y. The (directed) constraint graph (Fn, A): digraph with vertex set Fn an arc from y to y if and …
y. The (directed) constraint graph (Fn, A): digraph with vertex set Fn an arc from y to y if and …