Sciweavers

1016 search results - page 20 / 204
» Linear error-block codes
Sort
View
TIT
2010
105views Education» more  TIT 2010»
13 years 5 months ago
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
Joakim Jalden, Petros Elia
FOCS
1999
IEEE
14 years 3 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
GLOBECOM
2006
IEEE
14 years 5 months ago
Linear Joint Source-Channel Coding for Gaussian Sources through Fading Channels
Abstract— We consider the linear coding of a discrete memoryless Gaussian source transmitted through a discrete memoryless fading channel with additive white Gaussian noise (AWGN)...
Jinjun Xiao, Zhi-Quan Luo, Nihar Jindal
TCOM
2010
120views more  TCOM 2010»
13 years 9 months ago
Improved linear soft-input soft-output detection via soft feedback successive interference cancellation
—We propose an improved minimum mean square error (MMSE) vertical Bell Labs layered space-time (V-BLAST) detection technique, called a soft input, soft output, and soft feedback ...
Jun Won Choi, Andrew C. Singer, Jung Woo Lee, Nam ...
TIT
2002
72views more  TIT 2002»
13 years 10 months ago
Universal codes for finite sequences of integers drawn from a monotone distribution
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
Dean P. Foster, Robert A. Stine, Abraham J. Wyner