A remark on covering

01/10/2013
by   Vladimir Temlyakov, et al.
0

We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of good coverings. Here we apply incoherent dictionaries for construction of good coverings. We use the following strategy. First, we build a good covering by balls with a radius close to one. Second, we iterate this construction to obtain a good covering for any radius. We mostly concentrate on the first step of this strategy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2018

The Covering Radius of the Reed--Muller Code RM(2,7) is 40

It was proved by J. Schatz that the covering radius of the second order ...
research
06/25/2021

The Covering Radius of the Reed-Muller Code RM(m-4,m) in RM(m-3,m)

We present methods for computing the distance from a Boolean polynomial ...
research
04/09/2022

Spectral bounds of the ε-entropy of kernel classes

We develop new upper and lower bounds on the ε-entropy of a unit ball in...
research
05/19/2023

New bounds for covering codes of radius 3 and codimension 3t+1

The smallest possible length of a q-ary linear code of covering radius R...
research
06/29/2022

Saturating systems and the rank covering radius

We introduce the concept of a rank saturating system and outline its cor...
research
09/25/2020

Computing the covering radius of a polytope with an application to lonely runners

We are concerned with the computational problem of determining the cover...
research
10/15/2022

On depth-3 circuits and covering number: an explicit counter-example

We give a simple construction of n× n Boolean matrices with Ω(n^4/3) zer...

Please sign up or login with your details

Forgot password? Click here to reset