Pages that link to "Item:Q1377682"
From MaRDI portal
The following pages link to Binary codes with covering radius one: Some new lower bounds (Q1377682):
Displaying 12 items.
- A new lower bound for the football pool problem for 7 matches (Q679112) (← links)
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
- Lower bounds for \(q\)-ary codes of covering radius one (Q1567663) (← links)
- Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space (Q2322444) (← links)
- Combinatorial lower bounds on binary codes with covering radius one (Q2713644) (← 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)
- Some new lower bounds for binary and ternary covering codes (Q4307350) (← links)
- (Q4510805) (← links)
- On the size of optimal binary codes of length 9 and covering radius 1 (Q4544695) (← links)
- On the general excess bound for binary codes with covering radius one (Q5891409) (← links)
- On the general excess bound for binary codes with covering radius one (Q5900076) (← links)