114 search results - page 13 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
TIT
2008
15 years 8 days ago
2008
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
DCC
2005
IEEE
15 years 12 months ago
2005
IEEE
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
101
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...