Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
From MaRDI portal
Publication:2283219
DOI10.1007/s13226-019-0343-6zbMath1454.94141OpenAlexW2946163802MaRDI QIDQ2283219
Publication date: 30 December 2019
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-019-0343-6
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New bounds on binary identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- Upper bounds for binary identifying codes
- Sphere coverings and identifying codes
- Improved Upper Bounds on Binary Identifying Codes
- Identifying Codes and Covering Problems
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- On codes identifying sets of vertices in Hamming spaces
This page was built for publication: Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes