Non-intersecting subspaces with finite alphabet. Oggier, F., Sloane, N J A., Diggavi, S N., & A R. Calderbank, undefined IEEE Transactions on Information Theory, 51(12):4320–4325, December, 2005.
abstract   bibtex   
This paper was motivated by non-coherent space-time codes with fixed transmit alphabet constraints. To obtain maximal diversity order, the subspaces represented by the space-time codeword matrix needs to be non-intersecting. This led to the study of how many non-intersecting subspaces can be constructed from a finite alphabet.
@article{OSDCj05,
 abstract = {This paper was motivated by non-coherent space-time codes with
fixed transmit alphabet constraints. To obtain maximal diversity order, the subspaces
represented by the space-time codeword matrix needs to be non-intersecting. This led
to the study of how many non-intersecting subspaces can be constructed from a finite
alphabet.},
 author = {F. Oggier and N J A. Sloane and S N. Diggavi and A R. Calderbank,},
 file = {:papers:ps:subsp.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {osdc_j05},
 month = {December},
 note = {},
 number = {12},
 pages = {4320--4325},
 tags = {journal,NonCohComm,STcodes,Subsp},
 title = {Non-intersecting subspaces with finite alphabet},
 type = {2},
 volume = {51},
 year = {2005}
}
Downloads: 0