67 search results - page 9 / 14 » Information-Set Decoding for Linear Codes over Fq |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
TIT
1998
13 years 7 months ago
1998
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
FOCS
1999
IEEE
13 years 11 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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Linear dispersion coded orthogonal frequency division multiplexing (LDC-OFDM) has recently been proposed to improve joint frequency and time diversity. This paper inves...