Incomplete idempotent Schröder quasigroups and related packing designs.
Iterations of concave maps, the Perron-Frobenius theory, and applications to circle packings.
Leaves, excesses and neighborhoods
Minimum sum and difference covers of abelian groups.
Multi-covering radius for rank metric codes.
Multiple Lattice Packings and Coverings of Spheres.
Multiple tilings by cubes with no shared faces.
New Upper Bounds for Some Spherical Codes
The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases...
Note on packing and covering Turán numbers
Note on Packing of 19 Equal Circles on a Sphere.
On a covering problem of Mullin and Stanton for binary matroids.
On a Problem About Covering Lines by Squares.
On a problem about covering lines by squares.
On codes with given minimum distance and covering radius.
On codes with given minimum distance and covering radius.
On coset coverings of solutions of homogeneous cubic equations over finite fields.
On covering of bounded sets by sets with the twice less diameter
On homogeneous coverings of Euclidean spaces.
On kissing numbers in dimensions 32 to 128.
On packing spheres into containers.