A Grassmannian packing based on the Nordstrom-Robinson code

Vaneet Aggarwal; Alexei Ashikhmin; A. Robert Calderbank

doi:10.1109/ITW2.2006.323740

Back

Conference proceeding

A Grassmannian packing based on the Nordstrom-Robinson code

Vaneet Aggarwal, Alexei Ashikhmin and A. Robert Calderbank

PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, pp.1-5

01/01/2006

DOI: https://doi.org/10.1109/ITW2.2006.323740

Abstract

Engineering

Engineering, Electrical & Electronic

Science & Technology

Technology

Telecommunications

We construct new families of Grassmannian packings associated with the binary Nordstrom-Robinson code. The constituent subspaces are associated with projection operators which which arise in the theory of quantum stabilizer codes. These Grassmannian packings find application as highly structured of dictionaries that admit fast algorithms for identifying sparse representations, and in noncoherent wireless communication with multiple antennas. The capacity of the noncoherent MIMO channel at both low and moderate SNR (under the constraint that only isotropically distributed unitary matrices are used for information transmission) is closely approximated by these packings.

Metrics

1 Record Views

Details

Title: A Grassmannian packing based on the Nordstrom-Robinson code
Creators - without role: Vaneet Aggarwal - Princeton University
Alexei Ashikhmin
A. Robert Calderbank - Princeton University
Contributors - without role: P Z Fan
P Li
R Yeung
Publication Details: PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, pp.1-5
Publisher: IEEE
Number of pages: 5
Identifiers: 9943492608331
Academic Unit: King Abdulaziz University; King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding