Further results on the covering radius of codes
From MaRDI portal
Publication:3755361
DOI10.1109/TIT.1986.1057227zbMATH Open0618.94014MaRDI QIDQ3755361FDOQ3755361
Authors: N. J. A. Sloane, Gérard Cohen, Antoine Lobstein 
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
lower boundsnonlinear codescovering radiusbinary codeupper boundsnormal codesamalgamated direct summinial number of codewords
Cited In (56)
- On covering problems in hierarchical poset spaces
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- Title not available (Why is that?)
- New upper bounds for binary covering codes
- Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications
- Switching of covering codes
- Lower bounds for \(q\)-ary coverings by spheres of radius one
- Binary codes with covering radius one: Some new lower bounds
- Small complete caps in Galois affine spaces
- Maximal metrically regular sets
- Further results on the covering radius of small codes
- On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric
- Two-level screening designs derived from binary nonlinear codes
- Title not available (Why is that?)
- On the covering of vertices for fault diagnosis in hypercubes
- On the general excess bound for binary codes with covering radius one
- The solution to Berlekamp's switching game
- New results on codes with covering radius 1 and minimum distance \(2\)
- On the covering radius of Simplex codes
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
- On metric complements and metric regularity in finite metric spaces
- Covering codes with improved density
- A Lloyd theorem in weakly metric association schemes
- Subcodes and covering radius (Corresp.)
- Some optimal codes from algebraic geometry and their covering radii
- On covering radius of codes over \(R=\mathbb{Z}_2+u\mathbb{Z}_2\), where \(u^2=0\) using Chinese Euclidean distance
- Title not available (Why is that?)
- Improved sphere bounds on the covering radius of codes
- Bounds for abnormal binary codes with covering radius one
- Frequency computation and bounded queries
- Upper bounds for football pool problems and mixed covering codes
- Some results on the norm of codes
- A rational periodicity theorem for division codes
- On the general excess bound for binary codes with covering radius one
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- On deep holes of Gabidulin codes
- All binary codes with covering radius one are subnormal
- A nonconstructive upper bound on covering radius
- A construction of small complete caps in projective spaces
- Title not available (Why is that?)
- Bounds for binary multiple covering codes
- On the normality of multiple covering codes
- A note on the covering radius of optimum codes
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Long binary narrow-sense BCH codes are normal
- On lengthening of covering codes
- Some inequalities about the covering radius of Reed-Muller codes
- Small Complete Caps from Singular Cubics
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- On \(\mathbb{Z}_q\)-linear and \(\mathbb{Z}_q\)-simplex codes and its related parameters for \(q\) is a prime power
- On optimal binary codes with unbalanced coordinates
- Lower bound of covering radius of binary irreducible Goppa codes
- Density of constant radius normal binary covering codes
- Title not available (Why is that?)
This page was built for publication: Further results on the covering radius of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755361)
