193 search results - page 6 / 39 » Key Derivation for Squared-Friendly Applications: Lower Boun... |
TIT
2008
14 years 11 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
STOC
1999
ACM
15 years 3 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...
ALGORITHMICA
2005
14 years 11 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...