On covering sets and error-correcting codes
From MaRDI portal
Publication:2534837
Cites work
- A Combinatorial Problem in Matching
- Covering Problems Concerning Abelian Groups
- Covering problems for dichotomized matchings
- Covering problems for dichotomized matchings
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- scientific article; zbMATH DE number 3178047 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3313444 (Why is no real title available?)
- scientific article; zbMATH DE number 3054152 (Why is no real title available?)
- Intersection Inequalities for the Covering Problem
- Note on a theorem of Zaremba
- Rook domains, Latin squares, affine planes, and error-distributing codes
- The football pool problem for 5 matches
Cited in
(12)- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- New upper bounds for binary covering codes
- The complexity of total edge domination and some related results on trees
- Improved lower bounds on sizes of single-error correcting codes
- Domination parameters in hypertrees
- Two algorithms for determining a minimum independent dominating set
- Fundamentals of coding type problems
- Detecting arrays for effects of single factors
- Porous exponential domination number of some graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- A variation of distance domination in composite networks
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: On covering sets and error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2534837)
