Pages that link to "Item:Q4544695"
From MaRDI portal
The following pages link to On the size of optimal binary codes of length 9 and covering radius 1 (Q4544695):
Displayed 10 items.
- (Total) domination in prisms (Q510330) (← links)
- Switching codes and designs (Q658111) (← links)
- A remark on Haas' method (Q1025956) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- A new lower bound for the football pool problem for six matches (Q1865378) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- An updated table of binary/ternary mixed covering codes (Q4736760) (← links)
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one (Q6184529) (← links)
- Packings in bipartite prisms and hypercubes (Q6197743) (← links)