111 search results - page 5 / 23 » The Complexity of Local List Decoding |
TSP
2010
14 years 5 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
116
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties ...
85
Voted
ECCC
2010
14 years 5 months ago
2010
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
78
Voted
ICIP
2006
IEEE
15 years 12 months ago
2006
IEEE
Distributed video coding is a recent paradigm that enables a flexible distribution of the computational complexity between the encoder and the decoder building on top of distribut...