114 search results - page 9 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
— It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linear...
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
156
click to vote
WIOPT
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
105
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric code...
151
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...