Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.06417 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916586042949632 |
|---|---|
| author | Fickus, Matthew Gomez-Leos, Enrique Iverson, Joseph W. |
| author_facet | Fickus, Matthew Gomez-Leos, Enrique Iverson, Joseph W. |
| contents | Every equi-isoclinic tight fusion frame (EITFF) is a type of optimal code in a Grassmannian, consisting of subspaces of a finite-dimensional Hilbert space for which the smallest principal angle between any pair of them is as large as possible. EITFFs yield dictionaries with minimal block coherence and so are ideal for certain types of compressed sensing. By refining classical work of Lemmens and Seidel based on Radon-Hurwitz theory, we fully characterize EITFFs in the special case where the dimension of the subspaces is exactly one-half of that of the ambient space. We moreover show that each such "Radon-Hurwitz EITFF" is highly symmetric, where every even permutation is an automorphism. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_06417 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Radon-Hurwitz Grassmannian codes Fickus, Matthew Gomez-Leos, Enrique Iverson, Joseph W. Information Theory Functional Analysis 42C15 Every equi-isoclinic tight fusion frame (EITFF) is a type of optimal code in a Grassmannian, consisting of subspaces of a finite-dimensional Hilbert space for which the smallest principal angle between any pair of them is as large as possible. EITFFs yield dictionaries with minimal block coherence and so are ideal for certain types of compressed sensing. By refining classical work of Lemmens and Seidel based on Radon-Hurwitz theory, we fully characterize EITFFs in the special case where the dimension of the subspaces is exactly one-half of that of the ambient space. We moreover show that each such "Radon-Hurwitz EITFF" is highly symmetric, where every even permutation is an automorphism. |
| title | Radon-Hurwitz Grassmannian codes |
| topic | Information Theory Functional Analysis 42C15 |
| url | https://arxiv.org/abs/2404.06417 |