On binary linear r-identifying codes
From MaRDI portal
Publication:540477
DOI10.1007/S10623-010-9418-4zbMATH Open1220.05103OpenAlexW2101996333MaRDI QIDQ540477FDOQ540477
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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05) Fault detection; testing in circuits and networks (94C12)
Cites Work
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- 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
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Improved Upper Bounds on Binary Identifying Codes
- Optimal linear identifying codes
- Title not available (Why is that?)
- Bounds on identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On identifying codes in binary Hamming spaces
- Improved bounds on identifying codes in binary Hamming spaces
- On the size of identifying codes in binary hypercubes
- New bounds on binary identifying codes
- Constellation labeling for linear encoders
- Locating-Domination and Identification
- A class of I.P.P. codes with efficient identification
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
This page was built for publication: On binary linear \(r\)-identifying codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540477)
