Pages that link to "Item:Q3199338"
From MaRDI portal
The following pages link to Asymptotic bounds on the covering radius of binary codes (Q3199338):
Displaying 12 items.
- Covering radius and dual distance (Q811480) (← links)
- The covering radius of extreme binary 2-surjective codes (Q1008977) (← links)
- Asymptotic bound on binary self-orthogonal codes (Q1041514) (← links)
- The covering radius of spherical designs (Q1178026) (← links)
- On the covering radius of Reed-Muller codes (Q1199595) (← links)
- Weight distribution and dual distance (Q1320444) (← links)
- Optimal binary covering codes of length 2j (Q3376666) (← links)
- (Q3620562) (← links)
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
- Some new upper bounds on the covering radius of binary linear codes (Q3824229) (← links)
- On the covering radius of binary codes (Corresp.) (Q4158944) (← links)
- (Q4510805) (← links)