A novel soft information algorithm for closest point search in lattices with Tanner graph representations

Dumitru Mihai Ionescu Haidong Zhu

Published in: CoRR (2006)

Keyphrases

search space
closest point
dynamic programming
probabilistic model
tree structure
matching algorithm
simulated annealing
graph structure
learning algorithm
decision trees
image segmentation
optimal solution
clustering method
exhaustive search