60 search results - page 5 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
ICMCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Arising needs for extremely simple encoder motivate investigations on distributed video coding (DVC). The Wyner-Ziv coding, one of the representative DVC schemes, reconstructs vid...
TIT
2002
14 years 9 months ago
2002
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
ICS
2010
Tsinghua U.
15 years 1 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...