Iterative Algorithms for Finding the Stationary Points of the Dirty Tape Problem
Mustafa Kesal, Siddhartha Mallik, R. Koetter · 2006
Two distinct iterative algorithms are proposed for obtaining locally optimal strategies for the dirty tape problem. Although the resulting strategies show only a slight performance improvement over the scalar Costa solutions, we have enough evidence to conjecture that these strategies are the optimal lattice strategies. Further, our techniques are applicable in a wider scenario, since these algorithms do not assume the additive noise to be Gaussian