Note on the size of binary Armstrong codes (Q2439741): Difference between revisions

@@ Property / author @@
-Aart Blokhuis
@@ Property / author: Aart Blokhuis / rank @@
-Normal rank
@@ Property / author @@
+Aart Blokhuis
@@ Property / author: Aart Blokhuis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10623-012-9711-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2163978560
@@ Property / OpenAlex ID: W2163978560 / rank @@
+Normal rank
@@ Property / cites work @@
+Codes that attain minimum distance in every possible direction
+Normal rank
@@ Property / cites work @@
+On the Existence of Armstrong Instances with Bounded Domains
+Normal rank
@@ Property / cites work @@
+Q4242013
@@ Property / cites work: Q4242013 / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
+Normal rank
@@ Property / cites work @@
+The Perfect Binary One-Error-Correcting Codes of Length &lt;formula formulatype="inline"&gt;&lt;tex Notation="TeX"&gt;$15$&lt;/tex&gt;&lt;/formula&gt;: Part I—Classification
+Normal rank
@@ Property / cites work @@
+Q3615286
@@ Property / cites work: Q3615286 / rank @@
+Normal rank
@@ Property / cites work @@
+Coding Theory Motivated by Relational Databases
@@ Property / cites work: Coding Theory Motivated by Relational Databases / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2439741