On maximum length convolutional codes under a trellis complexity constraint (Q1827577): Difference between revisions

The authors investigate convolutional codes of maximum length for a given lower bound on the free distance and a given upper bound on the trellis complexity. Convolutional codes with \(r \times n\) parity check matrices are considered (so the codes are \((n,n-r)\) codes). In the case of free distance 3, the authors determine the maximum possible code length for a given complexity along with a construction for such codes when \(r=1\) and \(r=2\). For higher values of \(r\), the question is left open as to whether the construction given in the paper is maximal. In the case that the free distance is 4, a construction for maximum length codes is given for \(r=1\), leaving open whether the construction gives maximal length codes for \(r\geq 2\). The latter part of the paper is mainly devoted to presenting search algorithms for maximal length codes and describing the results of these algorithms.