Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331): Difference between revisions

@@ Property / describes a project that uses @@
+Magma
@@ Property / describes a project that uses: Magma / 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/s00373-014-1485-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2043253969
@@ Property / OpenAlex ID: W2043253969 / rank @@
+Normal rank
@@ Property / cites work @@
+The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
+Normal rank
@@ Property / cites work @@
+Hamiltonian uniform subset graphs
@@ Property / cites work: Hamiltonian uniform subset graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242024
@@ Property / cites work: Q4242024 / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation decoding for the binary codes from triangular graphs.
+Normal rank
@@ Property / cites work @@
+Binary codes from graphs on triples
@@ Property / cites work: Binary codes from graphs on triples / rank @@
+Normal rank
@@ Property / cites work @@
+PD-sets for the codes related to some classical varieties
+Normal rank
@@ Property / cites work @@
+Permutation Decoding of Systematic Codes
@@ Property / cites work: Permutation Decoding of Systematic Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank