114 search results - page 10 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
141
Voted
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
105
Voted
IMA
2001
Springer
15 years 4 months ago
2001
Springer
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
88
Voted
STOC
2005
ACM
16 years 20 days ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
81
Voted
CORR
2006
Springer
15 years 12 days ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
103
click to vote
TIT
2002
15 years 6 hour ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...