scientific article; zbMATH DE number 1284421
From MaRDI portal
Publication:4242015
zbMath0922.94020MaRDI QIDQ4242015
Richard A. Brualdi, Vera S. Pless, Simon N. Litsyn
Publication date: 18 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (13)
Further results on multiple coverings of the farthest-off points ⋮ A construction of small complete caps in projective spaces ⋮ On the covering radius of some binary cyclic codes ⋮ Constructing saturating sets in projective spaces using subgeometries ⋮ Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Bounds for short covering codes and reactive tabu search ⋮ Minimal 1-saturating sets and complete caps in binary projective spaces. ⋮ Linear codes with covering radius 3 ⋮ Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless ⋮ Asymmetric binary covering codes.
This page was built for publication:
