Improved lower bound for locating-dominating codes in binary Hamming spaces
From MaRDI portal
Publication:2068380
DOI10.1007/s10623-021-00963-8zbMath1482.94089arXiv2102.05537OpenAlexW3209938672MaRDI QIDQ2068380
Tero Laihonen, Tuomo Lehtilä, Ville Junnila
Publication date: 19 January 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.05537
Bounds on codes (94B65) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination and location in twin-free digraphs
- New identifying codes in the binary Hamming space
- Minimal identifying codes in trees and planar graphs with large girth
- Fault-tolerant locating-dominating sets
- On regular and new types of codes for location-domination
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
- On a conjecture regarding identification in Hamming graphs
- Optimal bounds on codes for location in circulant graphs
- Locating domination in bipartite graphs and their complements
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- On Stronger Types of Locating-dominating Codes
This page was built for publication: Improved lower bound for locating-dominating codes in binary Hamming spaces
