The following pages link to On coverings (Q2394642):
Displaying 50 items.
- Permutation decoding of codes from generalized Paley graphs (Q371247) (← links)
- Generalized packing designs (Q385379) (← links)
- Codes associated with the odd graphs (Q393176) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Partial permutation decoding for MacDonald codes (Q503553) (← links)
- Improved partial permutation decoding for Reed-Muller codes (Q507498) (← links)
- Some simple consequences of coding theory for combinatorial problems of packings and coverings (Q581409) (← links)
- Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
- Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four (Q663476) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Reed-Muller codes and permutation decoding (Q712223) (← links)
- Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
- Pair covering designs with block size 5 (Q879393) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Lower bounds for coverings of pairs by large blocks (Q910408) (← links)
- Permutation decoding for binary codes from lattice graphs (Q924975) (← links)
- Codes from incidence matrices and line graphs of Hamming graphs (Q973112) (← links)
- Binary codes from the line graph of the \(n\)-cube (Q975825) (← links)
- Partial permutation decoding for the first-order Reed-Muller codes (Q1025449) (← links)
- Further results on \((v,\{5,w^*\},1)\)-PBDs (Q1025489) (← links)
- Graphs, designs and codes related to the \(n\)-cube (Q1025949) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- On some covering designs (Q1065807) (← links)
- Covering triples by quadruples: an asymptotic solution (Q1072560) (← links)
- On the covering of pairs by quadruples (Q1080428) (← links)
- Coverings of pairs by quintuples (Q1106231) (← links)
- Coverings pairs by quintuples: The case v congruent to 3 (mod 4) (Q1116950) (← links)
- Certain recurrent and asymptotic estimates in the covering problem (Q1140649) (← links)
- The packing of pairs by quadruples (Q1179264) (← links)
- Singular points in pair covers and their relation to Hadamard designs (Q1182942) (← links)
- Balanced incomplete block designs and related designs (Q1239567) (← links)
- Steiner quadruple systems - a survey (Q1254321) (← links)
- Minimal covering and maximal packing of (k-1)-subsets by k-subsets (Q1257021) (← links)
- Covering graphs: The covering problem solved (Q1269896) (← links)
- General upper bounds on the minimum size of covering designs (Q1291117) (← links)
- On \(\lambda\)-covers of pairs by quintuples: \(v\) odd (Q1331137) (← links)
- On covering designs with block size 5 and index 5 (Q1345132) (← links)
- Permutation decoding for the binary codes from triangular graphs. (Q1422399) (← links)
- Existence of \((v,\{5,w^*\},1)\)-PBDs. (Q1428515) (← links)
- Some \(t\)-designs are minimal \((t+1)\)-coverings (Q1584345) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- Partial permutation decoding for codes from finite planes (Q1775031) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Puncture sets (Q1846873) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Codes from incidence matrices of graphs (Q1951220) (← links)
- On Turán numbers of the complete 4-graphs (Q1981665) (← links)
