19 search results - page 4 / 4 » On the Characterization of Linear Uniquely Decodable Codes |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
COCO
2011
Springer
12 years 5 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
VTC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, motivated by the recent concept of Spatial Modulation (SM), we propose a novel Generalized Space-Time Shift Keying (G-STSK) architecture, which acts as a unified Mul...