Pages that link to "Item:Q1281409"
From MaRDI portal
The following pages link to On lower bounds for covering codes (Q1281409):
Displaying 14 items.
- Almost cover-free codes and designs (Q510471) (← links)
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- Lower bounds on covering codes via partition matrices (Q1003655) (← links)
- A lower bound for 0,1,* tournament codes (Q1095111) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- Exact bounds on the sizes of covering codes (Q1406876) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Some new lower bounds for ternary covering codes (Q1918900) (← links)
- Sum-free sets and short covering codes (Q2918473) (← links)
- Linear inequalities for covering codes. I. Pair covering inequalities (Q3358649) (← links)
- Lower bounds for q-ary covering codes (Q3483225) (← links)
- Some new lower bounds for binary and ternary covering codes (Q4307350) (← links)
- Modified bounds for covering codes (Q5753891) (← links)