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 ; Tero Laihonen ORCID-iD; Sanna Ranto ORCID-iD

    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.


    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]
    Fundings :
      Source : OpenAIRE Research Graph
    • Identification and Error Correction; Funder: Academy of Finland; Code: 207303
    • Flowsheet and model reuse in process engineering; Funder: Academy of Finland; Code: 200213

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 188 times.
    This article's PDF has been downloaded 173 times.