A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces

Authors:
A. R. Calderbank;R. H. Hardin;E. M. Rains;P. W. Shor;N. J. A. Sloane
Affiliations:
Information Sciences Research, AT&T Labs—Research, 6180 Park Avenue, Florham Park, NJ 07932-0971;Information Sciences Research, AT&T Labs—Research, 6180 Park Avenue, Florham Park, NJ 07932-0971;Information Sciences Research, AT&T Labs—Research, 6180 Park Avenue, Florham Park, NJ 07932-0971;Information Sciences Research, AT&T Labs—Research, 6180 Park Avenue, Florham Park, NJ 07932-0971;Information Sciences Research, AT&T Labs—Research, 6180 Park Avenue, Florham Park, NJ 07932-0971
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
1999

Citing 4
Cited 4

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
A Family of Optimal Packings in Grassmannian Manifolds

Journal of Algebraic Combinatorics: An International Journal
Quantum error correction via codes over GF(4)

IEEE Transactions on Information Theory

The Invariants of the Clifford Groups

Designs, Codes and Cryptography
A survey on spherical designs and algebraic combinatorics on spheres

European Journal of Combinatorics
Bounds for codes and designs in complex subspaces

Journal of Algebraic Combinatorics: An International Journal
Grassmannian packings from operator Reed-Muller codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

By using totally isotropic subspaces in an orthogonal space Ω+ (2i, 2),several infinite families of packings of 2k-dimensional subspaces of real 2i-dimensional spaceare constructed, some of which are shown to be optimal packings.A certain Clifford group underlies theconstruction and links this problem with Barnes-Wall lattices,Kerdock sets and quantum-error-correcting codes.