The "art of trellis decoding" is computationally hard-for large fields

K. Jain, I. Mandoiu, V.V. Vazirani
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)  
| The problem of minimizing the trellis complexity of a code by coordinate permutation is proven NP-hard for three di erent measures of trellis complexity, provided the eld over which the code is speci ed is not xed.
doi:10.1109/isit.1998.708591 fatcat:uvycmr2zvjejhoccoyyidri6om