A Combinatorial Problem in Matching

DOI10.1112/JLMS/S1-44.1.60MaRDI QIDQ5573409zbMATH OpenOpenAlexFDO

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)

• \((r,k)\)-catching code
• On codes with covering radius 1 and minimum distance 2
• On mixed 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
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• How to guess two letters correctly
• Short coverings in tridimensional spaces arising from sum-free sets
• Bounds for covering codes over large alphabets
• New results 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
• Hypercube packings and coverings with higher dimensional rooks
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• Short covering codes arising from matchings in weighted graphs
• Short coverings and matching in weighted graphs
• On covering sets and error-correcting codes

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)