New Lower Bounds for Binary Constant-Dimension Subspace Codes.
Michael BraunPatric R. J. ÖstergårdAlfred WassermannPublished in: Exp. Math. (2018)
Keyphrases
- lower bound
- upper bound
- logical operations
- error correcting
- error correcting codes
- branch and bound algorithm
- constant factor
- branch and bound
- low dimensional
- binary codes
- lower dimensional
- error correction
- objective function
- high dimensional
- vc dimension
- dimensionality reduction
- high dimensional data
- non binary
- subspace learning
- linear subspace
- np hard
- principal component analysis
- online algorithms
- error detection
- feature space
- optimal cost
- quadratic assignment problem
- linear programming relaxation
- sample complexity
- clustering method
- subspace methods
- subspace clustering