116 search results - page 9 / 24 » On the tightness of the error bound in Ring-LWE |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— In many scenarios the commonly assumed symmetry in multiple relay channels is unrealistic. Therefore, this paper, through analytical and simulation efforts, investigate...
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
110
click to vote
WAW
2010
Springer
14 years 7 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
TCOM
2008
14 years 9 months ago
2008
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...