Codes for strong identification
From MaRDI portal
Recommendations
- Optimal codes for strong identification
- On strongly identifying codes
- Publication:4948746
- On identifying codes
- Strong identification codes for graphs
- Families of optimal codes for strong identification
- Connected Identifying Codes
- Codes for Interactive Authentication
- Improved identification schemes based on error-correcting codes
- Bounds on identifying codes
Cites work
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1436153 (Why is no real title available?)
- On a new class of codes for identifying vertices in graphs
- On codes identifying sets of vertices in Hamming spaces
- On strongly identifying codes
- On the structure of linear codes with covering radius two and three
- Two families of optimal identifying codes in binary Hamming spaces
Cited in
(7)- scientific article; zbMATH DE number 1583941 (Why is no real title available?)
- Families of optimal codes for strong identification
- Optimal codes for strong identification
- On two variations of identifying codes
- Code Reverse Engineering Problem for Identification Codes
- On strongly identifying codes
- scientific article; zbMATH DE number 2081125 (Why is no real title available?)
This page was built for publication: Codes for strong identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741420)