Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Tero Laihonen"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 1, ICGT 2018 (2019)
Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead t
Externí odkaz:
https://doaj.org/article/cbcb89a6d3cd4c179d0d259810af6307
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Graph Theory (2019)
Identifying and locating-dominating codes have been widely studied in circulant graphs of type $C_n(1,2, \ldots, r)$, which can also be viewed as power graphs of cycles. Recently, Ghebleh and Niepel (2013) considered identification and location-domin
Externí odkaz:
https://doaj.org/article/63804577a30746c1b5ae1eca8f0b8aad
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 1, Iss Combinatorics (2014)
Combinatorics
Externí odkaz:
https://doaj.org/article/e5931abc4f9f48fca6cdc3e6dd3a7d33
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 2 (2004)
Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in which we want to locate more than one malfunctionin
Externí odkaz:
https://doaj.org/article/a165132931f849c68dab8e6c68ff6892
Publikováno v:
IEEE Transactions on Information Theory. 67:3322-3341
The Levenshtein’s channel model for substitution errors is relevant in information retrieval where information is received through many noisy channels. In each of the channels there can occur at most $t$ errors and the decoder tries to recover the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2c56b909f5f73d31ab3af6fc69cff55
https://doi.org/10.1109/tit.2020.3016269
https://doi.org/10.1109/tit.2020.3016269
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7f40122301702a956740dc6c20a6a11
https://doi.org/10.1109/isit50566.2022.9834612
https://doi.org/10.1109/isit50566.2022.9834612
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, Springer Verlag, 2021, ⟨10.1007/s10623-021-00963-8⟩
Designs, Codes and Cryptography, Springer Verlag, 2021, ⟨10.1007/s10623-021-00963-8⟩
In this article, we study locating-dominating codes in binary Hamming spaces $$\mathbb {F}^n$$ . Locating-dominating codes have been widely studied since their introduction in 1980s by Slater and Rall. They are dominating sets suitable for distinguis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28610a806d4b912fe22fd6d1610e62ff
https://hal.archives-ouvertes.fr/hal-03386094
https://hal.archives-ouvertes.fr/hal-03386094
A set $R \subseteq V(G)$ is a resolving set of a graph $G$ if for all distinct vertices $v,u \in V(G)$ there exists an element $r \in R$ such that $d(r,v) \neq d(r,u)$. The metric dimension $\dim(G)$ of the graph $G$ is the minimum cardinality of a r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3f4b9e139f73228729eba69b0033ce8
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, $\{\ell\}$-resolving sets were recently introduced. In this paper, we present new results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69fd7e6e9d052f688068d04c4a4a8992
http://arxiv.org/abs/2003.02048
http://arxiv.org/abs/2003.02048
Publikováno v:
Discrete Applied Mathematics. 247:225-241
Identifying codes and locating-dominating codes have been designed for locating irregularities in sensor networks. In both cases, we can locate only one irregularity and cannot even detect multiple ones. To overcome this issue, self-identifying codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffe00b6890b6af45c35c7b4c296b54a9
https://doi.org/10.1016/j.dam.2018.03.050
https://doi.org/10.1016/j.dam.2018.03.050