111 search results - page 11 / 23 » From irreducible representations to locally decodable codes |
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
NIPS
2004
13 years 8 months ago
2004
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redundancy. Given a noisy neural representati...