A Combinatorial Problem in Matching

DOI10.1112/JLMS/S1-44.1.60zbMATH Open0182.02803OpenAlexW1964776956MaRDI QIDQ5573409FDOQ5573409

Authors: J. G. Kalbfleisch, R. G. Stanton 

Publication date: 1969

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-44.1.60

zbMATH Keywords

combinatorics

Cited In (18)

• New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• On covering sets and error-correcting codes
• On mixed codes with covering radius 1 and minimum distance 2
• Hypercube Packings and Coverings with Higher Dimensional Rooks
• Bounds for covering codes over large alphabets
• Short covering codes arising from matchings in weighted graphs
• New results on codes with covering radius 1 and minimum distance \(2\)
• On codes with covering radius 1 and minimum distance 2
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
• The covering problem in Rosenbloom-Tsfasman spaces
• Short coverings in tridimensional spaces arising from sum-free sets
• Sharp covering of a module by cyclic submodules
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Short coverings and matching in weighted graphs
• How to guess two letters correctly
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• \((r,k)\)-catching code

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)