On coverings

DOI10.2140/PJM.1964.14.1405zbMath0128.24501OpenAlexW4244691952MaRDI QIDQ2394642

J. Schönheim

Publication date: 1964

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1964.14.1405

zbMATH Keywords

combinatorics

Related Items (87)

On the covering of pairs by quadruples ⋮ On \(\lambda\)-covers of pairs by quintuples: \(v\) odd ⋮ On covering designs with block size 5 and index 5 ⋮ What we know and what we do not know about Turán numbers ⋮ Binary codes from rectangular lattice graphs and permutation decoding ⋮ Codes from the line graphs of complete multipartite graphs and PD-sets ⋮ Coverings of pairs by quintuples ⋮ Coverings pairs by quintuples: The case v congruent to 3 (mod 4) ⋮ Permutation decoding of codes from generalized Paley graphs ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ Pair covering designs with block size 5 ⋮ Generalized packing designs ⋮ Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes ⋮ Codes associated with the odd graphs ⋮ Certain recurrent and asymptotic estimates in the covering problem ⋮ An improvement on covering triples by quadruples ⋮ Constraint Orbital Branching ⋮ Renaming and the weakest family of failure detectors ⋮ Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even ⋮ Special \textit{LCD} codes from products of graphs ⋮ A tabu search algorithm for the covering design problem ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Matroid Horn functions ⋮ Galois geometries and coding theory ⋮ Lower bounds for coverings of pairs by large blocks ⋮ Codes from incidence matrices of graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ New advances in permutation decoding of first-order Reed-Muller codes ⋮ Permutation decoding for the binary codes from triangular graphs. ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Permutation decoding for binary codes from lattice graphs ⋮ Existence of \((v,\{5,w^*\},1)\)-PBDs. ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ The packing of pairs by quadruples ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ Singular points in pair covers and their relation to Hadamard designs ⋮ On Turán numbers of the complete 4-graphs ⋮ 3‐(v, 4, 1) covering designs with chromatic numbers 2 and 3 ⋮ Covering pairs by quintuples with index λ  0 (mod 4) ⋮ New constructions for covering designs ⋮ Partial permutation decoding for MacDonald codes ⋮ Improved partial permutation decoding for Reed-Muller codes ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Covering of subspaces by subspaces ⋮ Codes from incidence matrices and line graphs of Hamming graphs ⋮ Connected Covering Numbers ⋮ Information sets and partial permutation decoding for codes from finite geometries ⋮ Binary codes from the line graph of the \(n\)-cube ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ Partial permutation decoding for codes from finite planes ⋮ Reed-Muller codes and permutation decoding ⋮ Pair covering and other designs with block size 6 ⋮ Codes from the incidence matrices of graphs on 3-sets ⋮ New coverings oft-sets with (t + 1)-sets ⋮ On the constructive enumeration of packings and coverings of index one ⋮ Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\) ⋮ Codes from multipartite graphs and minimal permutation decoding sets ⋮ Some simple consequences of coding theory for combinatorial problems of packings and coverings ⋮ New results on GDDs, covering, packing and directable designs with block size 5 ⋮ Balanced incomplete block designs and related designs ⋮ Steiner quadruple systems - a survey ⋮ Minimal covering and maximal packing of (k-1)-subsets by k-subsets ⋮ Combinatorial coverings from geometries over principal ideal rings ⋮ Bounds on the sizes of constant weight covering codes ⋮ Matchings and covers in hypergraphs ⋮ Covering graphs: The covering problem solved ⋮ Partial permutation decoding for the first-order Reed-Muller codes ⋮ Further results on \((v,\{5,w^*\},1)\)-PBDs ⋮ Graphs, designs and codes related to the \(n\)-cube ⋮ MAX for \(k\)-independence in multigraphs ⋮ The minimum likely column cover problem ⋮ Generalized covering designs and clique coverings ⋮ Optimal antiblocking systems of information sets for the binary codes related to triangular graphs ⋮ On the covering of pairs by quadruples. I ⋮ Variable neighborhood descent heuristic for covering design problem ⋮ On the covering of pairs by quadruples. II ⋮ Almost designs and their links with balanced incomplete block designs ⋮ General upper bounds on the minimum size of covering designs ⋮ Binary codes from Paley graphs of prime-power-square order ⋮ Some \(t\)-designs are minimal \((t+1)\)-coverings ⋮ Puncture sets ⋮ Towards a Theory of Intrusion Detection ⋮ Binary codes from reflexive uniform subset graphs on 3-sets ⋮ Large sets of coverings ⋮ On some covering designs ⋮ Covering triples by quadruples: an asymptotic solution ⋮ Lotto design tables

This page was built for publication: On coverings