Several new lower bounds on the size of codes with covering radius one
From MaRDI portal
Publication:4701178
Recommendations
Cited in
(5)- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
- Combinatorial lower bounds on binary codes with covering radius one
- New results on codes with covering radius 1 and minimum distance \(2\)
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- An updated table of binary/ternary mixed covering codes
This page was built for publication: Several new lower bounds on the size of codes with covering radius one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701178)