On covering sets and error-correcting codes
From MaRDI portal
Publication:2534837
DOI10.1016/0097-3165(71)90051-3zbMath0181.22401OpenAlexW2055928358MaRDI QIDQ2534837
J. D. Horton, J. G. Kalbfleisch, Ralph G.Stanton
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(71)90051-3
Related Items (11)
Improved lower bounds on sizes of single-error correcting codes ⋮ New upper bounds for binary covering codes ⋮ Detecting arrays for effects of single factors ⋮ Porous exponential domination number of some graphs ⋮ Extended formulations for perfect domination problems and their algorithmic implications ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Two algorithms for determining a minimum independent dominating set ⋮ The complexity of total edge domination and some related results on trees ⋮ Domination Parameters in Hypertrees ⋮ Fundamentals of coding type problems ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- The football pool problem for 5 matches
- Note on a theorem of Zaremba
- A Combinatorial Problem in Matching
- Intersection Inequalities for the Covering Problem
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Covering Problems Concerning Abelian Groups
- Covering problems for dichotomized matchings
- Covering problems for dichotomized matchings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On covering sets and error-correcting codes
