Sciweavers

116 search results - page 18 / 24
» On the tightness of the error bound in Ring-LWE
Sort
View
CORR
2007
Springer
97views Education» more  CORR 2007»
14 years 9 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
TCOM
2010
114views more  TCOM 2010»
14 years 4 months ago
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme
This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short...
Nghi H. Tran, Tho Le-Ngoc, Tad Matsumoto, Ha H. Ng...
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
15 years 3 months ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
TIT
2010
101views Education» more  TIT 2010»
14 years 4 months ago
Wideband fading channel capacity with training and partial feedback
We consider the capacity of a wideband fading channel with partial feedback, subject to an average power constraint. A doubly block Rayleigh fading model is assumed with finite co...
Manish Agarwal, Michael L. Honig
SAC
2006
ACM
14 years 9 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...