Sciweavers

412 search results - page 9 / 83
» New Set of Codes for the Maximum-Likelihood Decoding Problem
Sort
View
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 2 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months ago
Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
G. Susinder Rajan, B. Sundar Rajan
ICASSP
2009
IEEE
15 years 4 months ago
TDOA estimation for cyclostationary sources: New correlations-based bounds and estimators
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
Moshe Teplitsky, Arie Yeredor
CORR
2006
Springer
152views Education» more  CORR 2006»
14 years 9 months ago
On Reduced Complexity Soft-Output MIMO ML detection
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...
Massimiliano Siti, Michael P. Fitz
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters