60 search results - page 1 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
TIT
2008
13 years 4 months ago
2008
The Gale
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper, we propose two types of new decoding algorithms for a network coding aided relaying (NCR) system, which adopts multiple antennas at both the transmitter and rece...
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
INFOCOM
2010
IEEE
2010
IEEE
Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints
13 years 2 months ago
Multimedia streaming applications have stringent QoS requirements. Typically each packet is associated with a packet delivery deadline. This work models and considers realtime stre...