On covering radius lower bound for a class of binary codes
From MaRDI portal
The main result is a theorem on doubly exponential limit distribution of the Hamming distance from a random vector to the nearest codeword in a given binary code. From the obtained results lower bounds on the covering radius of certain binary linear codes can be given. The proof of the main result is not given in the paper but in order to give a proof the author claims that he can use a technique suggested in one of the references.
Recommendations
Cited in
(16)- The covering radius of extreme binary 2-surjective codes
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
- Linear codes and character sums
- A nonconstructive upper bound on covering radius
- scientific article; zbMATH DE number 4218374 (Why is no real title available?)
- Optimal binary covering codes of length 2j
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- scientific article; zbMATH DE number 5543120 (Why is no real title available?)
- 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
- Some new upper bounds on the covering radius of binary linear codes
- On the covering radius of binary codes (Corresp.)
- Some new lower bounds for binary and ternary covering codes
- An improvement of the Van Wee bound for binary linear covering codes
- scientific article; zbMATH DE number 1522570 (Why is no real title available?)
- On the size of optimal binary codes of length 9 and covering radius 1
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)
