Families of optimal codes for strong identification
From MaRDI portal
(Redirected from Publication:1613402)
Recommendations
Cites work
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- Codes for strong identification
- On a new class of codes for identifying vertices in graphs
- On codes identifying sets of vertices in Hamming spaces
- On strongly identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
Cited in
(16)- Locating-domination and identification
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- On identifying codes in binary Hamming spaces
- Codes for strong identification
- On Iiro Honkala's contributions to identifying codes
- scientific article; zbMATH DE number 2081125 (Why is no real title available?)
- On robust and dynamic identifying codes
- Optimal codes for strong identification
- Optimal linear identifying codes
- Liar's domination
- Two families of optimal identifying codes in binary Hamming spaces
- A class of I.P.P. codes with efficient identification
- Codes identifying sets of vertices in random networks
- On identifying codes that are robust against edge changes
- Improved identification schemes based on error-correcting codes
- Paths and cycles identifying vertices in twisted cubes
This page was built for publication: Families of optimal codes for strong identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613402)
