On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
Bernardo Gabriel RodriguesPublished in: Ars Comb. (2007)
Keyphrases
- minimum weight
- hamming distance
- binary codes
- spanning tree
- weighted graph
- maximum cardinality
- bipartite graph
- minimum spanning tree
- edge weights
- pattern matching
- greedy heuristic
- distance measure
- minimum cost
- similarity search
- undirected graph
- training set
- hash functions
- object recognition
- graph theory
- edit distance
- graph matching
- directed graph
- graph structure
- shortest path
- nearest neighbor