Further results on the covering radius of codes
From MaRDI portal
Publication:3755361
DOI10.1109/TIT.1986.1057227zbMath0618.94014MaRDI QIDQ3755361
N. J. A. Sloane, Antoine C. Lobstein, Gérard D. Cohen
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
upper boundscovering radiusnonlinear codeslower boundsbinary codenormal codesamalgamated direct summinial number of codewords
Related Items (38)
Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ On \((p,1)\)-subnormal \(q\)-ary covering codes ⋮ Two-level screening designs derived from binary nonlinear codes ⋮ On the covering of vertices for fault diagnosis in hypercubes ⋮ Maximal metrically regular sets ⋮ Long binary narrow-sense BCH codes are normal ⋮ A Lloyd theorem in weakly metric association schemes ⋮ On ℤq-linear and ℤq-Simplex codes and its related parameters forqis a prime power ⋮ Further results on the covering radius of small codes ⋮ A construction of small complete caps in projective spaces ⋮ The solution to Berlekamp's switching game ⋮ Small Complete Caps from Singular Cubics ⋮ Small complete caps in Galois affine spaces ⋮ Binary codes with covering radius one: Some new lower bounds ⋮ New upper bounds for binary covering codes ⋮ On optimal binary codes with unbalanced coordinates ⋮ On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ 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 ⋮ Some optimal codes from algebraic geometry and their covering radii ⋮ On the general excess bound for binary codes with covering radius one ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ On the general excess bound for binary codes with covering radius one ⋮ A note on the covering radius of optimum codes ⋮ All binary codes with covering radius one are subnormal ⋮ Frequency computation and bounded queries ⋮ ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES ⋮ Switching of covering codes ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ On lengthening of covering codes ⋮ On deep holes of Gabidulin codes ⋮ On the covering radius of Simplex codes ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ Bounds for binary multiple covering codes ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ On the normality of multiple covering codes
This page was built for publication: Further results on the covering radius of codes
