Abstract
A construction based on a \(4l \times 4l\) Hadamard matrix leads to a new family of optimal orthoplex packings in Grassmannian spaces \(G_{\mathbb {R}}(8l, 4l)\) and \(G_{\mathbb {C}}(4l, 2l)\). A related construction gives an optimal simplex packings in \(G_{\mathbb {R}}(8 l-1, 4 l - 1)\) and \(G_{\mathbb {R}}(8l-1, 4l)\) with the additional assumption of an \(8l \times 8l\) skew Hadamard matrix and a related 1-factorization of a complete graph. A construction of a maximal optimal simplex packings in \(G_{\mathbb {C}}(2l-1, l- 1)\) and \(G_{\mathbb {C}}(2l-1,l)\) is given.
Similar content being viewed by others
References
Ashikhmin, A., Calderbank, A.R.: Space-time Reed–Muller codes for noncoherent MIMO transmission. In: International Symposium on Information Theory, pp. 1952–1956, Adelaide (2005)
Ashikhmin, A., Calderbank, A.R.: Grassmannian packings from operator Reed–Muller codes. IEEE Trans. Inf. Theory. 56, 5689–5714 (2010)
Bos, L., Waldron, S.: Some remarks on Heisenberg frames and sets of equiangular lines. N. Z. J. Math 36, 113–137 (2007)
Calderbank, A.R., Hardin, R.H., Rains, E.M., Shor, P.W., Sloane, N.J.A.: A group-theoretic framework for the construction of packings in Grassmannian spaces. J. Algebr. Comb. 9, 129–140 (1999)
Calderbank, R., Thompson, A., Xie, Y.: On block coherence of frames. Appl. Comput. Harmonic Anal. 38(1), 50–71 (2015)
Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, Boca Raton (2006)
Conway, J.H., Hardin, R.H., Sloane, N.J.A.: Packing lines, planes, etc.: packings in Grassmannian spaces. Exp. Math. 5, 139–159 (1996)
Dhillon, I.S., Heath, R.W., Jr., Strohmer, T., Tropp, J.A.: Constructing packings in Grassmannian manifolds via alternating projection. Exp. Math. 17, 9–35 (2007)
Kocák, T.: Master’s thesis. Comenius University, Bratislava (2013)
Lucas, E.: Récréations Mathématiques, vol. 2. Gauthier-Villars, Paris (1883). (Sixième récréation: Les jeux de demoiselles, pp. 161–197)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam (1977)
Rasmussen, R.V., Trick, M.A.: Round robin scheduling: a survey. Eur. J. Oper. Res. 188(3), 617–636 (2008)
Roy, A.: Bounds for codes and designs in complex subspaces. J. Algebr. Comb. 31, 1–32 (2010)
Shor, P.W., Sloane, N.J.A.: A family of optimal packings in Grassmannian manifolds. J. Algebr. Comb. 7, 157–163 (1998)
Strohmer, T., Heath, R.W., Jr.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmonic Anal. 14(3), 257–275 (2003)
Sustik, M.A., Tropp, J.A., Dhillon, I.S., Heath, R.W., Jr.: On the existence of equiangular tight frames. Linear Algebra Appl. 426, 619–635 (2007)
Sylvester, J.J.: A word on nonions. Johns Hopkins Univ. Circ. 1(17), 241–242 (1882)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kocák, T., Niepel, M. Families of optimal packings in real and complex Grassmannian spaces. J Algebr Comb 45, 129–148 (2017). https://doi.org/10.1007/s10801-016-0702-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-016-0702-x