Optimal codes for strong identification
From MaRDI portal
Publication:1612759
DOI10.1006/EUJC.2002.0571zbMATH Open1011.94027OpenAlexW2077667712MaRDI QIDQ1612759FDOQ1612759
Publication date: 19 May 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/64c9a1c25ccb8db72880168c3b9294c7587b5856
Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Combinatorial aspects of packing and covering (05B40) Other types of codes (94B60)
Cites Work
- On identifying codes
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- Sequences of optimal identifying codes
- On codes identifying sets of vertices in Hamming spaces
- Two families of optimal identifying codes in binary Hamming spaces
- Title not available (Why is that?)
- Bounds on identifying codes
- On strongly identifying codes
- General bounds for identifying codes in some infinite regular graphs
- Families of optimal codes for strong identification
- Codes for strong identification
- Title not available (Why is that?)
Cited In (15)
- A novel maximum distance separable code to generate universal identifiers
- Improved identification schemes based on error-correcting codes
- On identifying codes in binary Hamming spaces
- On robust and dynamic identifying codes
- Families of optimal codes for strong identification
- On robust identification in the square and King grids
- Codes for strong identification
- On Iiro Honkala's contributions to identifying codes
- Locating-Domination and Identification
- Sequences of optimal identifying codes
- A class of I.P.P. codes with efficient identification
- On identifying codes that are robust against edge changes
- Title not available (Why is that?)
- Optimal linear identifying codes
- Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
Recommendations
- Codes for strong identification 👍 👎
- Families of optimal codes for strong identification 👍 👎
- Two families of optimal identifying codes in binary Hamming spaces 👍 👎
- Sequences of optimal identifying codes 👍 👎
- Title not available (Why is that?) 👍 👎
- Optimal linear identifying codes 👍 👎
- On two variations of identifying codes 👍 👎
- On the identification of sets of points in the square lattice 👍 👎
- On codes identifying sets of vertices in Hamming spaces 👍 👎
- New bounds on binary identifying codes 👍 👎
This page was built for publication: Optimal codes for strong identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1612759)
