Te “art of trellis decoding” is computationally hard-for large fields

Authors:
K. Jain;I. Mandoin;V. V. Vazirani
Affiliations:
Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Ordered Binary Decision Diagrams and Minimal Trellises

IEEE Transactions on Computers
The "Art of trellis decoding" is NP-hard

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes

Quantified Score

Hi-index	754.84

Visualization

Abstract

The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the field over which the code is specified is not fixed. We leave open the problem of dealing with the case of a fixed field, in particular GF(2)