Covering problems for dichotomized matchings

DOI10.1007/BF01817562zbMath0159.03004OpenAlexW4253197377MaRDI QIDQ5920828

J. G. Kalbfleisch, Ralph G.Stanton

Publication date: 1968

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135944

zbMATH Keywords

group theory

Related Items (9)

Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ Independent domination in hypercubes ⋮ New upper bounds for binary covering codes ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ New results on codes with covering radius 1 and minimum distance \(2\) ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ On covering sets and error-correcting codes ⋮ On covering and coloring problems for rook domains

Cites Work

• COVERING THEOREMS FOR GROUPS
• A Covering Theorem for Abelian Groups
• Covering Problems Concerning Abelian Groups
• Unnamed Item

This page was built for publication: Covering problems for dichotomized matchings