Pages that link to "Item:Q3824229"
From MaRDI portal
The following pages link to Some new upper bounds on the covering radius of binary linear codes (Q3824229):
Displaying 12 items.
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- On the covering radius of cyclic linear codes and arithmetic codes (Q1065761) (← links)
- A new approach to the covering radius of codes (Q1086543) (← links)
- A note on the covering radius of optimum codes (Q1180145) (← links)
- Linear inequalities for covering codes. I. Pair covering inequalities (Q3358649) (← links)
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes (Q3548051) (← links)
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
- Linear inequalities for covering codes. II. Triple covering inequalities (Q4024544) (← links)
- Constructions, families, and tables of binary linear covering codes (Q4324203) (← links)
- An improvement of the Van Wee bound for binary linear covering codes (Q4324204) (← links)
- On the covering radius of Simplex codes (Q4440676) (← links)
- On the Newton and covering radii of linear codes (Q4503452) (← links)