Title :
The “art of trellis decoding” is computationally hard-for large fields
Author :
Jain, Kamal ; Mandoiu, Ion ; Vazirani, Vijay V.
Author_Institution :
Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
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
Keywords :
computational complexity; decoding; linear codes; minimisation; NP-hard problem; computationally hard problem; coordinate permutation; large fields; linear dose; trellis complexity minimisation; trellis decoding; Computational complexity; Coordinate measuring machines; Decoding; Educational institutions; Galois fields; Linear code; Size measurement; Subspace constraints;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708591
