On binary linear \(r\)-identifying codes
type: Item
instance of: scholarly article
title: On binary linear \(r\)-identifying codes
zbMATH Open document ID: 1220.05103
author: Sanna Ranto
published in: Designs, Codes and Cryptography
publication date: 2011-06-03T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94C12
zbMATH DE Number: 5903727
zbMATH Keywords: identifying codes
zbMATH Keywords: Hamming space
zbMATH Keywords: linear codes
MaRDI profile type: Publication
full work available at URL: s10623-010-9418-4
OpenAlex ID: W2101996333
cites work: Q4948746
cites work: Bounds on identifying codes
cites work: New identifying codes in the binary Hamming space
cites work: Improved bounds on identifying codes in binary Hamming spaces
cites work: Improved Upper Bounds on Binary Identifying Codes
cites work: Q4510800
cites work: On identifying codes in binary Hamming spaces
cites work: On a new class of codes for identifying vertices in graphs
cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs
cites work: Q4146667
cites work: Monotonicity of the minimum cardinality of an identifying code in the hypercube
cites work: Optimal linear identifying codes
DOI: 10.1007/S10623-010-9418-4
description: scientific article; zbMATH DE number 5903727