Result 81 to 100 of 238 total
Square complex orthogonal designs with low PAPR and signaling complexity (English)
IEEE Transactions on Wireless Communications 8, No. 1, 204-213 (2009).
81
Co-ordinate interleaved distributed space-time coding for two-antenna-relays networks (English)
IEEE Transactions on Wireless Communications 8, No. 4, 1783-1791 (2009).
82
Low PAPR square stbcs from complex partial-orthogonal designs (CPODs) (English)
IEEE Transactions on Wireless Communications 8, No. 5, 2369-2378 (2009).
83
Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training (English)
IEEE Transactions on Wireless Communications 8, No. 2, 683-688 (2009).
84
High-rate, multisymbol-decodable stbcs from Clifford algebras (English)
IEEE Transactions on Information Theory 55, No. 6, 2682-2695 (2009).
85
Multigroup decodable stbcs from Clifford algebras (English)
IEEE Transactions on Information Theory 55, No. 1, 223-231 (2009).
86
Asymptotic-information-lossless designs and the diversity-multiplexing tradeoff (English)
IEEE Transactions on Information Theory 55, No. 1, 255-268 (2009).
87
High-rate, single-symbol ML decodable precoded dstbcs for cooperative networks (English)
IEEE Transactions on Information Theory 55, No. 5, 2004-2015 (2009).
88
A low ML-decoding complexity, high coding gain, full-rate, full-diversity STBC for $4 \times 2$ MIMO system (English)
ICC, 1-5 (2009).
89
A training-based iterative detection/channel estimation scheme for large non-orthogonal STBC MIMO systems (English)
ICC, 1-5 (2009).
90
Constellation constrained capacity of two-user broadcast channels (English)
GLOBECOM, 1-6 (2009).
91
Convolutional codes for network-error correction (English)
GLOBECOM, 1-6 (2009).
92
Stbcs with reduced sphere decoding complexity for two-user MIMO-MAC (English)
GLOBECOM, 1-6 (2009).
93
Kernel in oriented circulant graphs (English)
IWOCA, 396-407 (2009).
94
Full-rate precoding in V-BLAST with angle parameter feedback (English)
PIMRC, 2539-2543 (2009).
95
Rupture degree of mesh and binary trees. (English)
J. Comb. Math. Comb. Comput. 67, 181-187 (2008).
96
Exact wirelength of hypercube layout on $k$-cube necklace. (English)
J. Comb. Math. Comb. Comput. 67, 67-76 (2008).
97
Minimally $k$-equitable labeling of butterfly and benes networks. (English)
J. Comb. Math. Comb. Comput. 67, 59-66 (2008).
98
Metric dimension of enhanced hypercube networks. (English)
J. Comb. Math. Comb. Comput. 67, 5-15 (2008).
99
Square complex orthogonal designs with no zero entry for any $2^{m}$ antennas. (English)
Comput. Res. Repos. 2008, Article No. 0812.2458 (2008).
100
Result 81 to 100 of 238 total
Start
Contact
Print
General Help
