114 search results - page 14 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
101
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
100
click to vote
TCOM
2010
14 years 10 months ago
2010
—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 ...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
127
click to vote
TEC
2008
14 years 11 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
127
Voted
ICMCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we study block codes that are optimized to recover some lost source data even in case when full recovery is not possible. Conventionally, block codes designed for p...