On transitive uniform partitions of \(F^n\) into binary Hamming codes (Q2323137): Difference between revisions

@@ Property / DOI @@
-.33048/semi.2019.16.058
@@ Property / DOI: 10.33048/semi.2019.16.058 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4342497
@@ Property / cites work: Q4342497 / rank @@
+Normal rank
@@ Property / cites work @@
+On Perfect Codes and Tilings: Problems and Solutions
+Normal rank
@@ Property / cites work @@
+Q3544770
@@ Property / cites work: Q3544770 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
+Normal rank
@@ Property / cites work @@
+A Partition of the Hypercube into Maximally Nonparallel Hamming Codes
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalized Parity Function and Its Use in the Construction of Perfect Codes
+Normal rank
@@ Property / cites work @@
+On a hypercube coloring problem
@@ Property / cites work: On a hypercube coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4488580
@@ Property / cites work: Q4488580 / rank @@
+Normal rank
@@ Property / cites work @@
+On transitive partitions of an \(n\)-cube into codes
+Normal rank
@@ Property / cites work @@
+Q3115222
@@ Property / cites work: Q3115222 / rank @@
+Normal rank
@@ Property / DOI @@
+.33048/SEMI.2019.16.058
@@ Property / DOI: 10.33048/SEMI.2019.16.058 / rank @@
+Normal rank