Pages that link to "Item:Q1897944"
From MaRDI portal
The following pages link to On covering radius lower bound for a class of binary codes (Q1897944):
Displaying 15 items.
- The covering radius of extreme binary 2-surjective codes (Q1008977) (← links)
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
- Linear codes and character sums (Q1410404) (← links)
- (Q3364579) (← links)
- Optimal binary covering codes of length 2j (Q3376666) (← links)
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes (Q3548051) (← links)
- (Q3620562) (← links)
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes (Q3786403) (← 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)
- An improvement of the Van Wee bound for binary linear covering codes (Q4324204) (← links)
- (Q4510805) (← links)
- On the size of optimal binary codes of length 9 and covering radius 1 (Q4544695) (← links)