60 search results - page 3 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
GLOBECOM
2009
IEEE
14 years 7 months ago
2009
IEEE
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
DCC
1999
IEEE
15 years 1 months ago
1999
IEEE
We present a method for utilizing soft information in decoding of variable length codes (VLCs). When compared with traditional VLC decoding, which is performed using "hard&quo...
ICCSA
2009
Springer
15 years 4 months ago
2009
Springer
This paper proposes a hybrid hard/soft decode-and-forward (DF) relaying protocol with distributed turbo code (DTC), based on error detection in cooperative communications. In order...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
73
Voted
TIT
2008
14 years 9 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...