Sciweavers

Share
32 search results - page 1 / 7
» Multicovering Bounds from Relative Covering Radii
Sort
View
SIAMDM
2002
84views more  SIAMDM 2002»
10 years 3 months ago
Multicovering Bounds from Relative Covering Radii
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...
Iiro S. Honkala, Andrew Klapper
DCC
2001
IEEE
11 years 3 months ago
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers
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...
Iiro S. Honkala, Andrew Klapper
COCOON
2005
Springer
10 years 9 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
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...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
TIT
2008
78views more  TIT 2008»
10 years 4 months ago
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
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...
Claude Carlet
JMLR
2002
135views more  JMLR 2002»
10 years 3 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
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...
Tong Zhang
books