1. F. Chen and P.A. Kelly, “Algorithms for generating and segmenting Morphologically smooth binary images”, in Proc. 26th Annual Conference on Information Sciences and Systems, Princeton University, Princeton, N.J., March 1992.
2. N.D. Sidiropoulos, “The Viterbi Optimal Runlength-Constrained Approximation Nonlinear Filter”, To appear: IEEE Trans. Signal Processing, March 1996 issue. Also available as Institute for Systems Research ISR TR 95–45; and University of Maryland at College Park, OTL Disclosure IS95–27.
3. A.J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm”, IEEE Trans. Information Theory, vol. IT-13, pp. 260–269, Apr. 1967.
4. J.K. Omura, “On the Viterbi decoding algorithm”, IEEE Trans. Information Theory, vol. IT-15, pp. 177–179, Jan. 1969.
5. B. Sklar, Digital Communications, Prentice Hall, Englewood Cliffs, NJ, 1988.