@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}
}

{"_id":"vfDtqzZ2RssmJh2Z6","bibbaseid":"oggier-sloane-diggavi-arcalderbank-nonintersectingsubspaceswithfinitealphabet-2005","author_short":["Oggier, F.","Sloane, N J A.","Diggavi, S N.","A R. Calderbank, undefined"],"bibdata":{"bibtype":"article","type":"2","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":[{"firstnames":["F."],"propositions":[],"lastnames":["Oggier"],"suffixes":[]},{"firstnames":["N","J","A."],"propositions":[],"lastnames":["Sloane"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"propositions":[],"lastnames":["A","R.","Calderbank"],"firstnames":[""],"suffixes":[]}],"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","volume":"51","year":"2005","bibtex":"@article{OSDCj05,\n abstract = {This paper was motivated by non-coherent space-time codes with\nfixed transmit alphabet constraints. To obtain maximal diversity order, the subspaces\nrepresented by the space-time codeword matrix needs to be non-intersecting. This led\nto the study of how many non-intersecting subspaces can be constructed from a finite\nalphabet.},\n author = {F. Oggier and N J A. Sloane and S N. Diggavi and A R. Calderbank,},\n file = {:papers:ps:subsp.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {osdc_j05},\n month = {December},\n note = {},\n number = {12},\n pages = {4320--4325},\n tags = {journal,NonCohComm,STcodes,Subsp},\n title = {Non-intersecting subspaces with finite alphabet},\n type = {2},\n volume = {51},\n year = {2005}\n}\n\n","author_short":["Oggier, F.","Sloane, N J A.","Diggavi, S N.","A R. Calderbank, undefined"],"key":"OSDCj05","id":"OSDCj05","bibbaseid":"oggier-sloane-diggavi-arcalderbank-nonintersectingsubspaceswithfinitealphabet-2005","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["non","intersecting","subspaces","finite","alphabet","oggier","sloane","diggavi","a r. calderbank"],"title":"Non-intersecting subspaces with finite alphabet","year":2005}