The following pages link to On coverings (Q2394642):
Displayed 43 items.
- Some simple consequences of coding theory for combinatorial problems of packings and coverings (Q581409) (← links)
- Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
- Pair covering designs with block size 5 (Q879393) (← links)
- Lower bounds for coverings of pairs by large blocks (Q910408) (← links)
- Permutation decoding for binary codes from lattice graphs (Q924975) (← 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)
- 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)
- On the constructive enumeration of packings and coverings of index one (Q2276965) (← links)
- Information sets and partial permutation decoding for codes from finite geometries (Q2490139) (← links)
- On the covering of pairs by quadruples. I (Q2554338) (← links)
- On the covering of pairs by quadruples. II (Q2560414) (← links)
- Codes from the line graphs of complete multipartite graphs and PD-sets (Q2643315) (← links)
- Lotto design tables (Q3150168) (← links)
- An improvement on covering triples by quadruples (Q3503599) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- (Q4242743) (← links)
- (Q4266929) (← links)
- 3‐(v, 4, 1) covering designs with chromatic numbers 2 and 3 (Q4373366) (← links)
- Covering pairs by quintuples with index λ 0 (mod 4) (Q4373368) (← links)
- New constructions for covering designs (Q4373370) (← links)
- Large sets of coverings (Q4764667) (← links)
- Pair covering and other designs with block size 6 (Q5434637) (← links)