27 search results - page 5 / 6 » Bounds on the Covering Radius of Linear Codes |
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
104
click to vote
MEDIAFORENSICS
2010
14 years 11 months ago
2010
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
STACS
2004
Springer
15 years 2 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
97
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
FOCS
2010
IEEE
14 years 7 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...