Trellis Complexity Bounds for Decoding Linear Block Codes

We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: If a trellis is optimum with respect to this partial ordering, if has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code.

[1]  Frank R. Kschischang,et al.  On the trellis structure of block codes , 1994, IEEE Trans. Inf. Theory.

[2]  Tom Verhoeff,et al.  An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.

[3]  G. David Forney,et al.  Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.

[4]  Shu Lin,et al.  On complexity of trellis structure of linear block codes , 1993, IEEE Trans. Inf. Theory.

[5]  Ľ.,et al.  Minimal Trellises for Linear Block Codes and Their Duals , 2022 .

[6]  Shu Lin,et al.  On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes , 1993, IEEE Trans. Inf. Theory.

[7]  R.J. McEliece.  The Viterbi decoding complexity of linear block codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[8]  R. McEliece,et al.  Minimal Trellises for Linear Block Codes and Their Duals , 1995 .

[9]  Alexander Vardy,et al.  Asymptotically good codes have infinite trellis complexity , 1995, IEEE Trans. Inf. Theory.

[10]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[11]  Alexander Vardy,et al.  Maximum-Likelihood Soft Decision Decoding of Bch Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.