The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Grassmannian frames with applications to coding and communication
Open accessAbstract
Abstract For a given class F of unit norm frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation |〈fk,fl〉| among all frames {f k } k∈ I ∈ F . We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These bounds yield a simple condition under which Grassmannian frames coincide with unit norm tight frames. We exploit connections to graph theory, equiangular line sets, and coding theory in order to derive explicit constructions of Grassmannian frames. Our findings extend recent results on unit norm tight frames. We then introduce infinite-dimensional Grassmannian frames and analyze their connection to unit norm tight frames for frames which are generated by group-like unitary systems. We derive an example of a Grassmannian Gabor frame by using connections to sphere packing theory. Finally we discuss the application of Grassmannian frames to wireless communication and to multiple description coding.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Foundations of Time-Frequency Analysis
Gröchenig, K. (2001) · Applied and Numerical Harmonic Analysis · doi:10.1007/978-1-4612-0003-1 · Cited by 2,923
Brouwer, A. E., & Haemers, W. H. (2011) · Universitext · doi:10.1007/978-1-4614-1939-6_12 · Cited by 1,987
Harmonic analysis in phase space
Folland, G. B. (1989) · Medical Entomology and Zoology · Cited by 1,960
Optimal state-determination by mutually unbiased measurements
Wootters, W. K., & Fields, B. D. (1989) · Annals of Physics · doi:10.1016/0003-4916(89)90322-9 · Cited by 1,424
Lower bounds on the maximum cross correlation of signals (Corresp.)
Welch, L. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055219 · Cited by 1,291
Delsarte, P., Goethals, J. M., & Seidel, J. J. (1977) · Geometriae Dedicata · doi:10.1007/bf03187604 · Cited by 925
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Conway, J. H., Hardin, R. H., & Sloane, N. J. A. (1996) · Experimental Mathematics · doi:10.1080/10586458.1996.10504585 · Cited by 755
Cited by
Grassmannian beamforming for multiple-input multiple-output wireless systems
Love, D. J., Heath, R. W., & Strohmer, T. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817466 · Cited by 1,505
Self-citationAn overview of limited feedback in wireless communication systems
Love, D., Heath, R., N. Lau, V., Gesbert, D., Rao, B., & Andrews, M. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.081002 · Cited by 1,503
Self-citationBlock-Sparse Signals: Uncertainty Relations and Efficient Recovery
Eldar, Y. C., Kuppinger, P., & Bolcskei, H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2044837 · Cited by 1,313
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
High-Resolution Radar via Compressed Sensing
Herman, M. A., & Strohmer, T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2014277 · Cited by 1,048
Self-citation
Metadata
- Authors
- Strohmer, T., & Heath, R. W.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2003-05
- Volume
- 14
- Issue
- 3
- Pages
- 257-275
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2086869478
- Cited by
- 955
- References
- 26
- FWCI
- 51.84
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Grassmannian frames with applications to coding and communication. https://app.cochat.ai/papers/10.1016/s1063-5203(03)00023-x
- The paper
- Strohmer, T., & Heath, R. W. (2003). Grassmannian frames with applications to coding and communication. Applied and Computational Harmonic Analysis. https://doi.org/10.1016/s1063-5203(03)00023-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
