Resolution of a conjecture on the covering radius of linear codes
From MaRDI portal
Recommendations
Cites work
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Covering radius 1985-1994
- Covering Radius Computations for Binary Cyclic Codes
- Covering radius---Survey and recent results
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 4168395 (Why is no real title available?)
- scientific article; zbMATH DE number 3965968 (Why is no real title available?)
- scientific article; zbMATH DE number 177857 (Why is no real title available?)
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- Nonexistence of linear codes meeting the Griesmer bound
- On codes meeting the Griesmer bound.
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
- On the geometric constructions of optimal linear codes
- On the size of optimal binary codes of length 9 and covering radius 1
- Optimum codes of dimension 3 and 4 over GF(4)
- Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications
- Switching of covering codes
- The complexity of computing the covering radius of a code
This page was built for publication: Resolution of a conjecture on the covering radius of linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616848)
