A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On binary linear r-identifying codes
Tekijät: Ranto S
Kustantaja: SPRINGER
Julkaisuvuosi: 2011
Journal: Designs, Codes and Cryptography
Tietokannassa oleva lehden nimi: DESIGNS CODES AND CRYPTOGRAPHY
Lehden akronyymi: DESIGN CODE CRYPTOGR
Numero sarjassa: 1
Vuosikerta: 60
Numero: 1
Aloitussivu: 81
Lopetussivu: 89
Sivujen määrä: 9
ISSN: 0925-1022
DOI: https://doi.org/10.1007/s10623-010-9418-4
Tiivistelmä
A subspace C of the binary Hamming space F (n) of length n is called a linear r-identifying code if for all vectors of F (n) the intersections of C and closed r-radius neighbourhoods are nonempty and different. In this paper, we give lower bounds for such linear codes. For radius r = 2, we give some general constructions. We give many (optimal) constructions which were found by a computer search. New constructions improve some previously known upper bounds for r-identifying codes in the case where linearity is not assumed.
A subspace C of the binary Hamming space F (n) of length n is called a linear r-identifying code if for all vectors of F (n) the intersections of C and closed r-radius neighbourhoods are nonempty and different. In this paper, we give lower bounds for such linear codes. For radius r = 2, we give some general constructions. We give many (optimal) constructions which were found by a computer search. New constructions improve some previously known upper bounds for r-identifying codes in the case where linearity is not assumed.
Turun yliopiston Tutkimustietojärjestelmän portaali