Error-correcting codes from \(k\)-resolving sets

DOI10.7151/dmgt.2087zbMath1406.94095arXiv1605.03141OpenAlexW2963621023MaRDI QIDQ1717187

Robert F. Bailey, Ismael González Yero

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03141

zbMATH Keywords

covering designerror-correcting codegrid graph\(k\)-metric dimension\(k\)-resolving setuncovering

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial codes (94B25) Decoding (94B35) Combinatorial aspects of packing and covering (05B40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Resolving sets tolerant to failures in three-dimensional grids ⋮ Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks ⋮ Computing the \(k\)-metric dimension of graphs ⋮ Some binary products and integer linear programming for \(k\)-metric dimension of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-metric dimension of the lexicographic product of graphs
• The \(k\)-metric dimension of corona product graphs
• Uncoverings-by-bases for base-transitive permutation groups.
• Permutation codes
• Error-correcting codes from permutation groups
• Resolvability in graphs and the metric dimension of a graph
• Computing the \(k\)-metric dimension of graphs
• Constructions for permutation codes in powerline communications
• On coverings
• Antiblocking systems and PD-sets
• Landmarks in graphs
• Uncoverings on graphs and network reliability
• Base size, metric dimension and other invariants of groups and graphs
• On the k-metric dimension of metric spaces
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• On Metric Generators of Graphs

This page was built for publication: Error-correcting codes from \(k\)-resolving sets