Nonintersecting subspaces based on finite alphabets
Publication
, Journal Article
Oggier, FE; Sloane, NJA; Diggavi, SN; Calderbank, R
Published in: IEEE International Symposium on Information Theory - Proceedings
October 20, 2004
Codewords were constructed subject to the constraint that the elements of the codewords use symbols from a fixed, small constellation. The subspaces constructed remain nonintersecting when lifted to the complex field. The construction shows that the codewords are nonintersecting over the finite field. The construction gives full diversity order when the elements of the codewords are restricted to come from a finite field.
Duke Scholars
Published In
IEEE International Symposium on Information Theory - Proceedings
Publication Date
October 20, 2004
Start / End Page
455
Citation
APA
Chicago
ICMJE
MLA
NLM
Oggier, F. E., Sloane, N. J. A., Diggavi, S. N., & Calderbank, R. (2004). Nonintersecting subspaces based on finite alphabets. IEEE International Symposium on Information Theory - Proceedings, 455.
Oggier, F. E., N. J. A. Sloane, S. N. Diggavi, and R. Calderbank. “Nonintersecting subspaces based on finite alphabets.” IEEE International Symposium on Information Theory - Proceedings, October 20, 2004, 455.
Oggier FE, Sloane NJA, Diggavi SN, Calderbank R. Nonintersecting subspaces based on finite alphabets. IEEE International Symposium on Information Theory - Proceedings. 2004 Oct 20;455.
Oggier, F. E., et al. “Nonintersecting subspaces based on finite alphabets.” IEEE International Symposium on Information Theory - Proceedings, Oct. 2004, p. 455.
Oggier FE, Sloane NJA, Diggavi SN, Calderbank R. Nonintersecting subspaces based on finite alphabets. IEEE International Symposium on Information Theory - Proceedings. 2004 Oct 20;455.
Published In
IEEE International Symposium on Information Theory - Proceedings
Publication Date
October 20, 2004
Start / End Page
455