Sciweavers

199 search results - page 22 / 40
» Linear time encodable and list decodable codes
Sort
View
FOCS
1994
IEEE
13 years 11 months ago
Expander Codes
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Michael Sipser, Daniel A. Spielman
ICANN
2009
Springer
14 years 15 hour ago
Learning from Examples to Generalize over Pose and Illumination
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
Marco K. Müller, Rolf P. Würtz
VTC
2007
IEEE
148views Communications» more  VTC 2007»
14 years 1 months ago
Iteratively Detected Irregular Variable Length Coding and Sphere-Packing Modulation-Aided Differential Space-Time Spreading
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
Mohammed El-Hajjar, Robert G. Maunder, Osamah Alam...
FOCS
1999
IEEE
13 years 11 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
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 7 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan