Classification of a class of distance-regular graphs via completely regular codes (Q1262870): Difference between revisions

@@ Property / cites work @@
+Q3218140
@@ Property / cites work: Q3218140 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625196
@@ Property / cites work: Q5625196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5707657
@@ Property / cites work: Q5707657 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization of H(n,q) by the parameters
@@ Property / cites work: Characterization of H(n,q) by the parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Q5682464
@@ Property / cites work: Q5682464 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888971
@@ Property / cites work: Q3888971 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3804608
@@ Property / cites work: Q3804608 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Nonexistence of Perfect Codes over Finite Fields
+Normal rank