A1 Refereed original research article in a scientific journal

On optimal edge-robust and vertex-robust (1,<= l)-identifying codes



Authors: Laihonen T

Publisher: SIAM PUBLICATIONS

Publication year: 2005

Journal: Siam Journal on Discrete Mathematics

Journal name in source: SIAM JOURNAL ON DISCRETE MATHEMATICS

Journal acronym: SIAM J DISCRETE MATH

Volume: 18

Issue: 4

First page : 825

Last page: 834

Number of pages: 10

ISSN: 0895-4801

DOI: https://doi.org/10.1137/S0895480104440754


Abstract
The motivation for identifying codes comes from maintenance of multiprocessor architectures. In this paper, we give infinite families of optimal edge- robust identifying codes and vertex- robust identifying codes in binary Hamming spaces.



Last updated on 2024-26-11 at 18:13