A random construction for permutation codes and the covering radius (Q851770): Difference between revisions

@@ Property / DOI @@
-.1007/s10623-006-0017-3
@@ Property / DOI: 10.1007/s10623-006-0017-3 / 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-006-0017-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2162296398
@@ Property / OpenAlex ID: W2162296398 / rank @@
+Normal rank
@@ Property / cites work @@
+Intersecting families of permutations
@@ Property / cites work: Intersecting families of permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Covering radius for sets of permutations
@@ Property / cites work: Covering radius for sets of permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Constructions for permutation codes in powerline communications
+Normal rank
@@ Property / cites work @@
+On the maximum number of permutations with given maximal or minimal distance
+Normal rank
@@ Property / cites work @@
+Constructions of permutation arrays
@@ Property / cites work: Constructions of permutation arrays / rank @@
+Normal rank
@@ Property / cites work @@
+INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
@@ Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Lopsided Lovász Local lemma and Latin transversals
+Normal rank
@@ Property / cites work @@
+Two Constructions of Permutation Arrays
@@ Property / cites work: Two Constructions of Permutation Arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds on permutation codes via linear programming
+Normal rank
@@ Property / DOI @@
+.1007/S10623-006-0017-3
@@ Property / DOI: 10.1007/S10623-006-0017-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:851770