论文信息 - The "art of trellis decoding" is computationally hard-for large fields

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

The problem of minimizing the trellis complexity of a code by coordinate permutation is proven NP-hard for three different measures of trellis complexity, provided the field over which the code is specified is not fixed.

[1] Alexander Vardy,et al. Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.

[2] Mitchell D. Trott,et al. The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders , 1993, IEEE Trans. Inf. Theory.