On covering radius lower bound for a class of binary codes
From MaRDI portal
Recommendations
Cited in
(16)- Linear codes and character sums
- scientific article; zbMATH DE number 1522570 (Why is no real title available?)
- scientific article; zbMATH DE number 5543120 (Why is no real title available?)
- Some new upper bounds on the covering radius of binary linear codes
- The covering radius of extreme binary 2-surjective codes
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
- Optimal binary covering codes of length 2j
- Some new lower bounds for binary and ternary covering codes
- An improvement of the Van Wee bound for binary linear covering codes
- On the size of optimal binary codes of length 9 and covering radius 1
- A nonconstructive upper bound on covering radius
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- On the covering radius of binary codes (Corresp.)
- scientific article; zbMATH DE number 4218374 (Why is no real title available?)
This page was built for publication: On covering radius lower bound for a class of binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897944)
