On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
Pascal O. VontobelRoxana SmarandachePublished in: CoRR (2005)
Keyphrases
- vector quantization
- graph theoretic
- hamming distance
- reconstruction from multiple views
- directed graph
- graph matching
- three dimensional
- projective space
- graph mining
- error correcting codes
- planar curves
- image compression
- spanning tree
- graph model
- graph representation
- pattern matching
- low cost
- d objects
- dynamic programming