description.txt

来自「普渡大学D. J. Love教授优化的Grassmaniann Packings」· 文本 代码 · 共 3 行

The complex (or real) Grassmann manifold G(m,k) is the set of k-dimensional subspaces in Cm (or Rm).  Grassmannian subspace packing is the problem of finding a set of N k-dimensional subspaces in G(m,k) that maximize the minimum distance between any pair of subspaces in the set.  

zhu: cb_ia_0313.mat是对one_d里一些码书进行IA得出的.