Abstract: We extend the results of our previous paper [8] to the nonlinear case: The. Lloyd polynomial of the covering has at least R distinct roots among 1 ...

Electrical Engineering and Computer Science - Technical Reports ; Title. On Perfect Weighted Coverings with Small Radius ; Author(s)/Creator(s). G. D. Cohen

Jun 22, 2005 · On perfect weighted coverings with small radius. Conference paper; First Online: 01 January 2005. pp 32–41; Cite this conference paper.

For all these codes the diameter of the covering spheres equals the covering radius of the code which by use of Delsaxte's results leads to a very rigid set of ...

Description/Abstract This paper deals with an extension of perfect codes to fractional (or weighted) coverings. We shall derive a Lloyd theorem---a strong ...

We investigate PWC with diameter 1, finding a partial characterization. We complete an investigation begun in [8] on linear PMC with distance 1 and diameter 2.

Fingerprint. Dive into the research topics of 'On perfect weighted coverings with small radius'. Together they form a unique fingerprint.

Explicit formulas for the weight distributions of translates are given for small weights i(i<8) . The computation of the weight distribution of all translates ( ...

Theorem 2 provides us with simple algorithms for the computation of the covering radius t(V) for the code V. For small t(V) the following algorithm may be used ...

In this chapter we discuss upper bounds on covering radius in binary space. There is an essential difference between the two notions.