Partial linear spaces and identifying codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 2081125 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- Cages—a survey
- Construction of codes identifying sets of vertices
- Dynamic cage survey
- Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
- Identifying and locating-dominating codes on chains and cycles
- Improved bounds on identifying codes in binary Hamming spaces
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- New identifying codes in the binary Hamming space
- On (minimal) regular graphs of girth \(6\)
- On a new class of codes for identifying vertices in graphs
- On cages admitting identifying codes
- On geometric constructions of \((k,g)\)-graphs
- On the Non-Existence of a Type of Regular Graphs of Girth 5
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Upper bounds for binary identifying codes
Cited in
(4)
This page was built for publication: Partial linear spaces and identifying codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627920)