A1 Refereed original research article in a scientific journal
On binary linear r-identifying codes
Authors: Ranto S
Publisher: SPRINGER
Publication year: 2011
Journal: Designs, Codes and Cryptography
Journal name in source: DESIGNS CODES AND CRYPTOGRAPHY
Journal acronym: DESIGN CODE CRYPTOGR
Number in series: 1
Volume: 60
Issue: 1
First page : 81
Last page: 89
Number of pages: 9
ISSN: 0925-1022
DOI: https://doi.org/10.1007/s10623-010-9418-4
Abstract
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.
UTU Research Portal