2536 search results - page 153 / 508 » Constructing Optimal Highways |
102
click to vote
TIT
2010
14 years 6 months ago
2010
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
STOC
2004
ACM
16 years 5 days ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
EUROCAST
2005
Springer
15 years 5 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
103
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...