Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks.
Natalia SilbersteinAnna-Lena TrautmannPublished in: IEEE Trans. Inf. Theory (2015)
Keyphrases
- graphical representation
- maximum cardinality
- bipartite graph
- random walk
- graph structure
- graph model
- subspace clustering
- weighted graph
- subspace learning
- graph theoretic
- graph representation
- directed acyclic graph
- feature space
- graph theory
- directed graph
- connected components
- graph matching
- dimensionality reduction
- graph based algorithm
- high dimensional