Packing Lines, Planes, etc.: Packings in Grassmannian Spaces

From MaRDI portal
Publication:4717345

DOI10.1080/10586458.1996.10504585zbMath0864.51012arXivmath/0208004OpenAlexW2035469609WikidataQ56049947 ScholiaQ56049947MaRDI QIDQ4717345

Conway, John H., R. H. Hardin, N. J. A. Sloane

Publication date: 14 January 1997

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0208004



Related Items

Three-point bounds for energy minimization, Harmonic Grassmannian codes, The core of a Grassmannian frame, Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound, Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold, Optimal Parseval frames: total coherence and total volume, Doubly transitive lines. II: Almost simple symmetries, Unnamed Item, Radon transforms and packings, Packing regular triplets of circles on a sphere, Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping, OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS, POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES, Globally Optimizing Small Codes in Real Projective Spaces, New Constructions of Codebooks Nearly Meeting the Welch Bound, On symmetric decompositions of positive operators, Optimal configurations of lines and a statistical application, Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases, Random fusion frames are nearly equiangular and tight, An estimator for the diagonal of a matrix, DC semidefinite programming and cone constrained DC optimization. I: Theory, Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets, A bound on Grassmannian codes, Designs, groups and lattices, Equioverlapping measurements, Equiangular tight frames that contain regular simplices, Unit time-phase signal sets: bounds and constructions, Uncertainty quantification for complex systems with very high dimensional response using Grassmann manifold variations, Hadamard equiangular tight frames, Learning Subspaces of Different Dimensions, A family of optimal packings in Grassmannian manifolds, A Short Introduction to Optimal Line Packings, Impacts of high dimensionality in finite samples, Generalized asymptotically optimal codebooks, The Optimal Packing of Eight Points in the Real Projective Plane, Six constructions of asymptotically optimal codebooks via the character sums, Probability modelled optimal frames for erasures, Toward the classification of biangular harmonic frames, Packing of twinned circles on a sphere, Equiangular lines and subspaces in Euclidean spaces, Grassmannian frames with applications to coding and communication, Optimal arrangements of classical and quantum states with limited purity, Two new constructions of approximately SIC-POVMs from multiplicative characters, Two are better than one: fundamental parameters of frame coherence, On \(p\)-tuples of equi-isoclinic 3-spaces in the Euclidean space, Frame potentials and the geometry of frames, Low-energy points on the sphere and the real projective plane, Cayley sum graphs and their applications to codebooks, Computing the Distance Between Frames and Between Subspaces of a Hilbert Space, Maximal orthoplectic fusion frames from mutually unbiased bases and block designs, Gradient projection method on matrix manifolds, On the performance of high-gain observers with gain adaptation under measurement noise, Optimal frames for erasures., Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations, Mutually unbiased bases and Hadamard matrices of order six, A kernel-based framework to tensorial data analysis, Codes and designs in Grassmannian spaces., A new class of near-optimal partial Fourier codebooks from an almost difference set, On block coherence of frames, Equichordal tight fusion frames, A note on equiangular tight frames, Quantum polarization characterization and tomography, Geometric mean and geodesic regression on Grassmannians, On the search for tight frames of low coherence, A short history of frames and quantum designs, Biangular lines revisited, Grassmannian codes from paired difference sets, Explicit volume-preserving splitting methods for linear and quadratic divergence-free vector fields, Equiangular subspaces in Euclidean spaces, Combinatorial constructions of packings in Grassmannian spaces, Doubly transitive lines. I: Higman pairs and roux, Lattices from equiangular tight frames, Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\), Optimal line packings from nonabelian groups, Families of optimal packings in real and complex Grassmannian spaces, More constructions of near optimal codebooks associated with binary sequences, Tight \(p\)-fusion frames, Grassmannian frequency of Sobolev dimension distortion, Every Hilbert space frame has a Naimark complement, Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes, Two constructions of asymptotically optimal codebooks according to the Welch bound, Bounds for codes and designs in complex subspaces, On the size of incoherent systems, Two classes of near-optimal codebooks with respect to the Welch bound, Constructions of biangular tight frames and their relationships with equiangular tight frames, A further construction of asymptotically optimal codebooks with multiplicative characters, Packings in Real Projective Spaces, Well-distributed great circles on \(\mathbb S^2\), Harmonic equiangular tight frames comprised of regular simplices, Stolarsky's invariance principle for projective spaces, Constructing subspace packings from other packings, Equiangular tight frames from Paley tournaments, On the existence of equiangular tight frames, Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms, New Upper Bounds for Equiangular Lines by Pillar Decomposition, Two constructions of asymptotically optimal codebooks via the trace functions, Robust dimension reduction, fusion frames, and Grassmannian packings, Nearly optimal codebooks based on generalized Jacobi sums, A General Least Squares Regression Framework on Matrix Manifolds for Computer Vision, Uniform recovery of fusion frame structured sparse signals, Codebooks from almost difference sets, Principal symmetric space analysis, Bounds on antipodal spherical designs with few angles, Some constructions of superimposed codes in Euclidean spaces., Schubert Varieties and Distances between Subspaces of Different Dimensions, The gradient projection method with Armijo's step size on manifolds, Two constructions of asymptotically optimal codebooks, A group-theoretic framework for the construction of packings in Grassmannian spaces, A survey on spherical designs and algebraic combinatorics on spheres, Regular two-distance sets, Universally optimal distribution of points on spheres, Unnamed Item, Two families of nearly optimal codebooks, An extension of Bravyi-Smolin's construction for UMEBs, A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions, Designs in Grassmannian spaces and lattices


Uses Software


Cites Work