On the trellis complexity of nonlinear codes
Yue Dian-wu · Chinese Journal of Radio Science · 2004
In this paper, the trellis complexity of nonlinear codes is considered.Dimension/length profiles for nonlinear codes are first defined,and using the definition the definition the lower bound on the trellis complexity of linear codes gotten by Forney is generalized to nonlinear codes.Then the Berger-Be′ery′s upper bound on the trellis complexity for nonlinear codes is also derived.