Pages that link to "Item:Q1866019"
From MaRDI portal
The following pages link to Bounds on the covering radius of linear codes (Q1866019):
Displaying 15 items.
- Linear covering codes and error-correcting codes for limited-magnitude errors (Q398936) (← links)
- On the least covering radius of binary linear codes of dimension 6 (Q540386) (← links)
- On the covering radius of an unrestricted code as a function of the rate and dual distance (Q1383375) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- On covering radius lower bound for a class of binary codes (Q1897944) (← links)
- Asymptotical properties of linear codes (Q1970696) (← links)
- Linear codes with covering radius 3 (Q2267791) (← links)
- Linear inequalities for covering codes. I. Pair covering inequalities (Q3358649) (← links)
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
- Improved sphere bounds on the covering radius of codes (Q3799949) (← links)
- Some new upper bounds on the covering radius of binary linear codes (Q3824229) (← links)
- Linear inequalities for covering codes. II. Triple covering inequalities (Q4024544) (← links)
- On the structure of linear codes with covering radius two and three (Q4324111) (← links)
- An improvement of the Van Wee bound for binary linear covering codes (Q4324204) (← links)
- On the Newton and covering radii of linear codes (Q4503452) (← links)