Improved Lower Bound for Locating-Dominating Codes in Binary Hamming Spaces - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Designs, Codes and Cryptography Année : 2021

Improved Lower Bound for Locating-Dominating Codes in Binary Hamming Spaces

Résumé

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 distinguishing vertices in graphs. Dominating sets as well as locating-dominating codes have been studied in Hamming spaces in multiple articles. Previously, Honkala et al. (2004) have presented a lower bound for locating-dominating codes in binary Hamming spaces. In this article, we improve the lower bound for all values $n\geq10$. In particular, when $n=11$, we manage to improve the previous lower bound from $309$ to $317$. This value is very close to the current best known upper bound of $320$.

Dates et versions

hal-03386094 , version 1 (19-10-2021)

Identifiants

Citer

Ville Junnila, Tero Laihonen, Tuomo Lehtilä. Improved Lower Bound for Locating-Dominating Codes in Binary Hamming Spaces. Designs, Codes and Cryptography, 2021, ⟨10.1007/s10623-021-00963-8⟩. ⟨hal-03386094⟩
24 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More