Sciweavers

9 search results - page 2 / 2
» On the Decoding Complexity of Cyclic Codes Up to the BCH Bou...
Sort
View
CORR
2011
Springer
166views Education» more  CORR 2011»
12 years 11 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
JOC
2008
92views more  JOC 2008»
13 years 7 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson