All binary codes with covering radius one are subnormal (Q1182971): Difference between revisions

@@ Property / author @@
+Iiro S. Honkala
@@ Property / author: Iiro S. Honkala / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Covering radius---Survey and recent results
@@ Property / cites work: Covering radius---Survey and recent results / rank @@
+Normal rank
@@ Property / cites work @@
+Further results on the covering radius of codes
@@ Property / cites work: Further results on the covering radius of codes / rank @@
+Normal rank
@@ Property / cites work @@
+On the covering radius of codes
@@ Property / cites work: On the covering radius of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for binary covering codes
@@ Property / cites work: Lower bounds for binary covering codes / rank @@
+Normal rank
@@ Property / cites work @@
+Modified bounds for covering codes
@@ Property / cites work: Modified bounds for covering codes / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for abnormal binary codes with covering radius one
+Normal rank
@@ Property / cites work @@
+On the Covering Radius Problem for Codes  II.  Codes of Low Dimension; Normal and Abnormal Codes
+Normal rank
@@ Property / cites work @@
+The hardness of solving subset sum with preprocessing
+Normal rank
@@ Property / cites work @@
+Improved sphere bounds on the covering radius of codes
+Normal rank
@@ Property / cites work @@
+More binary covering codes are normal
@@ Property / cites work: More binary covering codes are normal / rank @@
+Normal rank