32 search results - page 1 / 7 » Multicovering Bounds from Relative Covering Radii |
SIAMDM
2002
13 years 4 months ago
2002
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
DCC
2001
IEEE
14 years 3 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
TIT
2008
13 years 4 months ago
2008
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
JMLR
2002
13 years 4 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...