A Combinatorial Problem in Matching
From MaRDI portal
Cited in
(19)- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- How to guess two letters correctly
- Lower bounds for \(q\)-ary coverings by spheres of radius one
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- New results on codes with covering radius 1 and minimum distance 2
- On codes with covering radius 1 and minimum distance 2
- Sharp covering of a module by cyclic submodules
- New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
- Short coverings in tridimensional spaces arising from sum-free sets
- On covering sets and error-correcting codes
- Bounds for covering codes over large alphabets
- Short coverings and matching in weighted graphs
- Hypercube packings and coverings with higher dimensional rooks
- Short covering codes arising from matchings in weighted graphs
- On mixed codes with covering radius 1 and minimum distance 2
- (r,k)-catching code
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
- A classification of invariant sets of constant-weight tuples and applications to covering schemes
- The covering problem in Rosenbloom-Tsfasman spaces
This page was built for publication: A Combinatorial Problem in Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573409)
