1998•IEEE Transactions on Information TheoryRequires access

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

Kamal Kishore Jain, I. Mandoin, Vijay V. Vazirani

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).

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Trellis (graph), Space–time trellis code, Decoding methods, Permutation (music), Computational complexity theory, Convolutional code, Mathematics, Code (set theory)