On the covering radius of codes
From MaRDI portal
Publication:3712236
DOI10.1109/TIT.1985.1057039zbMath0585.94012OpenAlexW2136319083MaRDI QIDQ3712236
N. J. A. Sloane, Ronald L. Graham
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1985.1057039
Related Items
On \((p,1)\)-subnormal \(q\)-ary covering codes, A new approach to the covering radius of codes, Maximal metrically regular sets, Long binary narrow-sense BCH codes are normal, The solution to Berlekamp's switching game, New upper bounds for binary covering codes, Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\), Optimization of $$\mathsf {LPN}$$ Solving Algorithms, On the string consensus problem and the Manhattan sequence consensus problem, Completely regular codes and completely transitive 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, On the covering radius of a code and its subcodes, On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric, Memoryless near-collisions via coding theory, A note on the covering radius of optimum codes, All binary codes with covering radius one are subnormal, Density of constant radius normal binary covering codes, Covering bounds for codes, ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES, Orphan structure of the first-order Reed--Muller codes, A Graham-Sloane type construction for \(s\)-surjective matrices, The covering radius of the cycle code of a graph, Covering machines, On lengthening of covering codes, Consensus String Problem for Multiple Regular Languages, Minimal 1-saturating sets and complete caps in binary projective spaces., Closest substring problems for regular languages, 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], On deep holes of Gabidulin codes, Consensus string problem for multiple regular languages, Bounds for binary multiple covering codes, Optimal Covering Codes for Finding Near-Collisions, Upper bounds for football pool problems and mixed covering codes, Construction of new codes and its related parameters, On saturating sets in small projective geometries, An efficient algorithm for solving the partial sum query problem, Asymmetric binary covering codes., Classification of cosets of the Reed-Muller code \(R(m-3,m)\), On the normality of multiple covering codes
