52 search results - page 6 / 11 » Decoding Turbo-Like Codes via Linear Programming |
148
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
132
click to vote
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...
151
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
139
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
144
click to vote
CC
2008
Springer
15 years 5 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...