Non-lattice covering and quanitization of high dimensional sets

06/04/2020
by   Jack Noonan, et al.
0

The main problem considered in this paper is construction and theoretical study of efficient n-point coverings of a d-dimensional cube [-1,1]^d. Targeted values of d are between 5 and 50; n can be in hundreds or thousands and the designs (collections of points) are nested. This paper is a continuation of our paper <cit.>, where we have theoretically investigated several simple schemes and numerically studied many more. In this paper, we extend the theoretical constructions of <cit.> for studying the designs which were found to be superior to the ones theoretically investigated in <cit.>. We also extend our constructions for new construction schemes which provide even better coverings (in the class of nested designs) than the ones numerically found in <cit.>. In view of a close connection of the problem of quantization to the problem of covering, we extend our theoretical approximations and practical recommendations to the problem of construction of efficient quantization designs in a cube [-1,1]^d. In the last section, we discuss the problems of covering and quantization in a d-dimensional simplex; practical significance of this problem has been communicated to the authors by Professor Michael Vrahatis, a co-editor of the present volume.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/16/2020

Efficient quantization and weak covering of high dimensional cubes

Let ℤ_n = {Z_1, ..., Z_n} be a design; that is, a collection of n points...
02/14/2020

Covering of high-dimensional cubes and quantization

As the main problem, we consider covering of a d-dimensional cube by n b...
12/29/2019

Solving X^q+1+X+a=0 over Finite Fields

Solving the equation P_a(X):=X^q+1+X+a=0 over finite field Q, where Q=p^...
06/22/2020

C-differential bent functions and perfect nonlinearity

Drawing inspiration from Nyberg's paper <cit.> on perfect nonlinearity a...
01/10/2013

A remark on covering

We discuss construction of coverings of the unit ball of a finite dimens...
06/01/2020

Note to "An efficient Data Structure for Lattice Operation"

This note is to publicly answer to a paper recently accepted to SWAT 202...
11/23/2020

Rephased CLuP

In <cit.> we introduced CLuP, a Random Duality Theory (RDT) based algori...