On binary linear \(r\)-identifying codes
From MaRDI portal
Publication:540477
DOI10.1007/s10623-010-9418-4zbMath1220.05103MaRDI QIDQ540477
Publication date: 3 June 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9418-4
94B05: Linear codes (general theory)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94C12: Fault detection; testing in circuits and networks
Related Items
Cites Work
- On identifying codes in binary Hamming spaces
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- Improved Upper Bounds on Binary Identifying Codes
- On a new class of codes for identifying vertices in graphs
- Optimal linear identifying codes
- Bounds on identifying codes
- Unnamed Item
- Unnamed Item
- Unnamed Item