Families of optimal packings in real and complex Grassmannian spaces

DOI10.1007/s10801-016-0702-xzbMath1381.52026OpenAlexW2477460231MaRDI QIDQ510063

Tomáš Kocák, Martin Niepel

Publication date: 16 February 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-016-0702-x

zbMATH Keywords

Hadamard matricesspace-time codeschordal distanceGrassmannian packingsoptimal packingsRankin bound

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Grassmannians, Schubert varieties, flag manifolds (14M15) Other types of codes (94B60) Algebraic systems of matrices (15A30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Boolean and Hadamard matrices (15B34) Orthogonal and unitary groups in metric geometry (51F25)

Related Items

Grassmannian codes from paired difference sets ⋮ Combinatorial constructions of packings in Grassmannian spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On block coherence of frames
• On the existence of equiangular tight frames
• A group-theoretic framework for the construction of packings in Grassmannian spaces
• A family of optimal packings in Grassmannian manifolds
• Grassmannian frames with applications to coding and communication
• Bounds for codes and designs in complex subspaces
• Round robin scheduling -- a survey
• Constructing Packings in Grassmannian Manifolds via Alternating Projection
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Grassmannian Packings From Operator Reed–Muller Codes

This page was built for publication: Families of optimal packings in real and complex Grassmannian spaces