Bounding decoding complexity

Figures A.8 and A.9 show the results of applying various Viterbi decoding constraints to G-codes. Specifically, Figures A.8 and A.9 show the decoding complexity achieved under linear and quadratic decoding bounds. The degradation in code length, compared to the standard lexicodes, is modest for these examples.

**Figure:** The effects of bounding the decoding complexity of distance 6 G-codes with a linear function.
$\resizebox{!}{3in}{\includegraphics{Figures/linbound.eps}}$

**Figure:** The effects of bounding the decoding complexity of distance 6 G-codes with a quadratic function.
$\resizebox{!}{3in}{\includegraphics{Figures/quadbound.eps}}$

http://people.bu.edu/trachten