Iiro Honkala ; Tero Laihonen ; Sanna Ranto - On Locating-Dominating Codes in Binary Hamming Spaces

dmtcs:322 - Discrete Mathematics & Theoretical Computer Science, January 1, 2004, Vol. 6 no. 2 - https://doi.org/10.46298/dmtcs.322
On Locating-Dominating Codes in Binary Hamming Spaces

Authors: Iiro Honkala 1; Tero Laihonen ORCID-iD1; Sanna Ranto ORCID-iD1

  • 1 Department of Mathematics

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 malfunctioning processor.

https://doi.org/10.46298/dmtcs.322
Source: HAL:hal-00959008v1
Volume: Vol. 6 no. 2
Published on: January 1, 2004
Imported on: March 26, 2015
Keywords: Locating-dominating codes,Hamming space,Identifying codes,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Flowsheet and model reuse in process engineering; Funder: Academy of Finland; Code: 200213
  • Identification and Error Correction; Funder: Academy of Finland; Code: 207303

2 Documents citing this article

Share and export

Consultation statistics

This page has been seen 233 times.
This article's PDF has been downloaded 217 times.