A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes.
Marc RouanneDaniel J. Costello Jr.Published in: IEEE Trans. Inf. Theory (1988)
Keyphrases
- euclidean distance
- lower bound
- lower bounding
- upper bound
- distance measure
- distance metric
- dynamic time warping
- image space
- distance function
- similarity measurement
- branch and bound algorithm
- similarity measure
- data points
- feature vectors
- euclidean space
- mahalanobis distance
- np hard
- high dimensional spaces
- cosine distance
- coding scheme
- branch and bound
- lower and upper bounds
- objective function
- minimum cost
- dimensionality reduction
- subsequence matching
- optimal solution
- manhattan distance