Totally symmetric Grassmannian codes
Matthew Fickus, Joseph W. Iverson, John Jasper, Dustin G. Mixon

TL;DR
This paper introduces a novel construction method for symmetric tight fusion frames, resulting in optimal Grassmannian codes with total symmetry, enhancing the design of highly symmetric subspace arrangements.
Contribution
The paper presents a new technique for constructing totally symmetric equi-isoclinic tight fusion frames, advancing the theory of optimal Grassmannian codes.
Findings
Constructed a new family of totally symmetric EITFFs
Achieved optimal Grassmannian codes with total symmetry
Demonstrated the unitary permutation property of subspaces
Abstract
We introduce a general technique to construct tight fusion frames with prescribed symmetries. Applying this technique with a prescription for "all the symmetries", we construct a new family of equi-isoclinic tight fusion frames (EITFFs), which consequently form optimal Grassmannian codes. By virtue of their construction, our EITFFs have the remarkable property of total symmetry: any permutation of subspaces can be achieved by an appropriate unitary.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications
