scientific article; zbMATH DE number 1284421
From MaRDI portal
Publication:4242015
Recommendations
Cited in
(57)- On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
- A new approach to the covering radius of codes
- An optimal polynomial for a covering radius problem
- On the covering radius of Reed-Solomon codes
- On the covering radius of long 5-ary BCH codes with minimum distance 7
- Exact bounds on the sizes of covering codes
- Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications
- The covering radii of a class of binary cyclic codes and some BCH codes
- Asymmetric binary covering codes.
- On the packing radius and the covering radius of equal-weight codes
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- Constructing saturating sets in projective spaces using subgeometries
- Linear codes with covering radius 3
- The two covering radius of the two error correcting BCH code
- 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
- A construction of small complete caps in projective spaces
- On the covering radius of some binary cyclic codes
- Covering radii are not matroid invariants
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- On an algebraic method for bounding the covering radius
- Asymptotic minimum covering radius of block codes
- Generalization of the Norse bounds to codes of higher strength
- Asymptotic bounds on the covering radius of binary codes
- Further results on multiple coverings of the farthest-off points
- scientific article; zbMATH DE number 4208003 (Why is no real title available?)
- On octonary codes and their covering radii
- Unidirectional covering codes
- On covering radius of a family of codes \({\mathcal C}_m\cup(1+{\mathcal C}_m)\) with maximum distance between \({\mathcal C}_m\) and \(1+{\mathcal C}_m\)
- On the covering radius of codes
- Covering radius---Survey and recent results
- scientific article; zbMATH DE number 3965968 (Why is no real title available?)
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 4008282 (Why is no real title available?)
- scientific article; zbMATH DE number 4041787 (Why is no real title available?)
- On the covering radius of binary (14, 6) codes containing the all-one vector
- Explicit codes with low covering radius
- Short codes with a given covering radius
- scientific article; zbMATH DE number 4108663 (Why is no real title available?)
- scientific article; zbMATH DE number 49931 (Why is no real title available?)
- The multicovering radii of codes
- On the covering radius of Simplex codes
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- A Brief Survey of Covering Radius
- On the covering radius of some modular codes
- scientific article; zbMATH DE number 910954 (Why is no real title available?)
- scientific article; zbMATH DE number 1456813 (Why is no real title available?)
- On the covering radii of a class of binary primitive cyclic codes
- Covering radius of matrix codes endowed with the rank metric
- On Generalized Hamming Weights and the Covering Radius of Linear 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
- Resolution of a conjecture on the covering radius of linear codes
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Covering radius 1985-1994
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- Bounds for short covering codes and reactive tabu search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242015)
