Bounds on the minimum code distance for nonbinary codes based on bipartite graphs.
Alexey A. FrolovVictor V. ZyablovPublished in: Probl. Inf. Transm. (2011)
Keyphrases
- bipartite graph
- non binary
- decoding algorithm
- maximum matching
- constraint satisfaction problems
- edge weights
- link prediction
- maximum cardinality
- upper bound
- minimum weight
- lower bound
- bipartite graph matching
- mining high utility itemsets
- mutual reinforcement
- spanning tree
- minimum cost
- worst case
- computational complexity
- hamming distance
- arc consistency
- heuristic search
- np hard