114 search results - page 15 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
180
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
157
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
163
click to vote
VTC
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
159
click to vote
VTC
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
242
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...