Convolutional codes under a minimal trellis complexity measure
Bartolomeu Ferreira Uchoa-Filho, Richard Demo Souza, Cecilio Jose Lins Pimentel, Marcel Jar · IEEE Transactions on Communications · 2009
We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.