Pages that link to "Item:Q1086543"
From MaRDI portal
The following pages link to A new approach to the covering radius of codes (Q1086543):
Displaying 19 items.
- Simplifications to ``A new approach to the covering radius'' (Q804540) (← links)
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- On the normality of multiple covering codes (Q1322275) (← links)
- New upper bounds for the football pool problem for 11 and 12 matches (Q1331131) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- Addendum to: J. M. van den Akker, et al., Perfect codes with distinct protective radii (Q2277430) (← links)
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces (Q2334437) (← links)
- Covering radii are not matroid invariants (Q2484374) (← links)
- (Q3028870) (← links)
- New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions (Q3547197) (← links)
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius (Q3786402) (← links)
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes (Q3786403) (← links)
- Improved sphere bounds on the covering radius of codes (Q3799949) (← links)
- (Q3822200) (← links)
- Some new upper bounds on the covering radius of binary linear codes (Q3824229) (← links)
- On the Newton and covering radii of linear codes (Q4503452) (← links)
- (Q4736423) (← links)