A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On codes identifying sets of vertices in Hamming spaces
Tekijät: Honkala I, Laihonen T, Ranto S
Kustantaja: KLUWER ACADEMIC PUBL
Julkaisuvuosi: 2001
Journal: Designs, Codes and Cryptography
Tietokannassa oleva lehden nimi: DESIGNS CODES AND CRYPTOGRAPHY
Lehden akronyymi: DESIGN CODE CRYPTOGR
Vuosikerta: 24
Numero: 2
Aloitussivu: 193
Lopetussivu: 204
Sivujen määrä: 12
ISSN: 0925-1022
DOI: https://doi.org/10.1023/A:1011256721935
Tiivistelmä
A code C subset of or equal to F-2(n) is called (t, less than or equal to2)-identifying if for all the words x, y (x not equal y) and z the sets (B-t (x) boolean OR B-t (y)) boolean AND C and B-t (z) boolean AND C are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of (t, F)-identifying codes and introduce weakly identifying codes.
A code C subset of or equal to F-2(n) is called (t, less than or equal to2)-identifying if for all the words x, y (x not equal y) and z the sets (B-t (x) boolean OR B-t (y)) boolean AND C and B-t (z) boolean AND C are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of (t, F)-identifying codes and introduce weakly identifying codes.
Turun yliopiston Tutkimustietojärjestelmän portaali