On binary linear r-identifying codes



: Ranto S

Publisher: SPRINGER

: 2011

: Designs, Codes and Cryptography

: DESIGNS CODES AND CRYPTOGRAPHY

: DESIGN CODE CRYPTOGR

: 1

: 60

: 1

: 81

: 89

: 9

: 0925-1022

DOI: https://doi.org/10.1007/s10623-010-9418-4


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.



Last updated on 2024-26-11 at 21:26