Bounds on codes derived by counting components in Varshamov graphs.
Katie O'BrienPatrick FitzpatrickPublished in: ISIT (2004)
Keyphrases
- upper bound
- closed form expressions
- lower bound
- building blocks
- graph theoretic
- upper and lower bounds
- error correction
- confidence bounds
- labeled graphs
- tight bounds
- graph construction
- lower and upper bounds
- spanning tree
- data sets
- graph matching
- directed graph
- similarity search
- semi supervised
- genetic algorithm
- machine learning