# Nonintersecting subspaces based on finite alphabets

Journal Article (Journal Article)

Two subspaces of a vector space are here called "nonintersecting" if they meet only in the zero vector. Motivated by the design of noncoherent multiple-antenna communications systems, we consider the following question. How many pairwise nonintersecting M -dimensional subspaces of an m-dimensional vector space V over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A ⊆ F? The most important case is when F is the field of complex numbers C; then M is the number of antennas. If A = F = GF(q) it is shown that the number of nonintersecting subspaces is at most (q - 1)/(q - 1), and that this bound can be attained if and only if m is divisible by M . Furthermore, these subspaces remain nonintersecting when "lifted" to the complex field. It follows that the finite field case is essentially completely solved. In the case when F = C only the case M = 2 is considered. It is shown that if A is a PSK-configuration, consisting of the 2 complex roots of unity, the number of nonintersecting planes is at least 2 and at most 2 (the lower bound may in fact be the best that can be achieved. © 2005 IEEE. t t t t m Mt r r(m-2) r(m-1)-1

### Full Text

### Duke Authors

### Cited Authors

- Oggier, FE; Sloane, NJA; Diggavi, SN; Calderbank, AR

### Published Date

- December 1, 2005

### Published In

### Volume / Issue

- 51 / 12

### Start / End Page

- 4320 - 4325

### International Standard Serial Number (ISSN)

- 0018-9448

### Digital Object Identifier (DOI)

- 10.1109/TIT.2005.858946

### Citation Source

- Scopus