24 search results - page 4 / 5 » Some combinatorial constructions for optical orthogonal code... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
TIT
2010
13 years 2 months ago
2010
In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) are introduced to consider how to construct and then exclude (or include) the basis codewo...
TIT
2002
13 years 7 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
STACS
2004
Springer
14 years 24 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
ECCC
2006
13 years 7 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...