Pages that link to "Item:Q1406876"
From MaRDI portal
The following pages link to Exact bounds on the sizes of covering codes (Q1406876):
Displaying 11 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)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Covers and partial transversals of Latin squares (Q2414936) (← links)
- A coding theoretic application of Zsolt Baranyai's factorization theorem (Q2859455) (← links)
- Sum-free sets and short covering codes (Q2918473) (← links)
- Some Bounds on the Size of Codes (Q2986470) (← links)
- Optimal binary covering codes of length 2j (Q3376666) (← links)
- On small covering codes in arbitrary mixed hamming spaces (Q3539612) (← links)
- Modified bounds for covering codes (Q5753891) (← links)