On binary linear \(r\)-identifying codes (Q540477): Difference between revisions

@@ Property / cites work @@
+Q4948746
@@ Property / cites work: Q4948746 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on identifying codes
@@ Property / cites work: Bounds on identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+New identifying codes in the binary Hamming space
@@ Property / cites work: New identifying codes in the binary Hamming space / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on identifying codes in binary Hamming spaces
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds on Binary Identifying Codes
@@ Property / cites work: Improved Upper Bounds on Binary Identifying Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4510800
@@ Property / cites work: Q4510800 / rank @@
+Normal rank
@@ Property / cites work @@
+On identifying codes in binary Hamming spaces
@@ Property / cites work: On identifying codes in binary Hamming spaces / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity of the minimum cardinality of an identifying code in the hypercube
+Normal rank
@@ Property / cites work @@
+Optimal linear identifying codes
@@ Property / cites work: Optimal linear identifying codes / rank @@
+Normal rank