Construction of linear covering codes
From MaRDI portal
The paper under review deals with covering radius of binary linear codes. The author proposes a new construction of infinite families of covering codes with covering radius R using an arbitrary code with covering radius \(R_ 0\leq R\). As an application he constructs infinite families of codes with \(R\geq 2\) with better parameters than the known codes.
Recommendations
- Construction of a class of linear codes
- Constructions of nonlinear covering codes
- scientific article; zbMATH DE number 520162
- Constructions, families, and tables of binary linear covering codes
- scientific article; zbMATH DE number 3882337
- Publication:4945067
- On the Covering Dimension of a Linear Code
- scientific article; zbMATH DE number 5054194
- New constructions of covering codes
- Linear codes from a generic construction
Cited in
(18)- Covering machines
- New upper bounds for binary covering codes
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Solving LPN Using Covering Codes
- Linear codes from a generic construction
- An Upper Bound on Covering Radius
- New covering codes from an ADS-like construction
- Code Construction on Fiber Products of Kummer Covers
- scientific article; zbMATH DE number 1188995 (Why is no real title available?)
- Linear covering codes and error-correcting codes for limited-magnitude errors
- scientific article; zbMATH DE number 520162 (Why is no real title available?)
- scientific article; zbMATH DE number 645821 (Why is no real title available?)
- Constructions, families, and tables of binary linear covering codes
- scientific article; zbMATH DE number 1082111 (Why is no real title available?)
- New constructions of covering codes
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- Further results on covering codes with radius R and codimension tR+1
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
This page was built for publication: Construction of linear covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640576)
