60 search results - page 4 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
EJASP
2010
14 years 4 months ago
2010
In this paper we propose a block-by-block iterative receiver for underwater MIMO-OFDM that couples channel estimation with MIMO detection and channel decoding. In particular, the c...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
74
Voted
TIT
2002
14 years 9 months ago
2002
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...