10988 search results - page 286 / 2198 » Algorithmic Folding Complexity |
134
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
159
click to vote
IJCSA
2007
15 years 4 months ago
2007
The Rhagoletis pomonella species complex consists of at least four sibling species. They are highly host specific as larvae, and display great fidelity as adults. The only certain...
130
click to vote
IJSYSC
2000
15 years 4 months ago
2000
The generation of complex entities with advantageous behaviours beyond our manual design capability requires long-term incremental evolution with continuing emergence. In this pap...
152
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
139
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...