14 search results - page 2 / 3 » Bounds on ordered codes and orthogonal arrays |
SIAMDM
2008
13 years 5 months ago
2008
Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y C if di {xi, yi} for 1 i n. A code C is an identifiable parent prop...
MCS
2010
Springer
13 years 3 months ago
2010
Springer
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...
TCOM
2008
13 years 5 months ago
2008
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...