关于非线性码的格子复杂度

On the trellis complexity of nonlinear codes

研究了非线性码的格子复杂度。给出了非线性码的维数 /长度轮廓的定义 ,并利用这一定义 ,将Forney所给出的线性码格子复杂度的新下界推广到了非线性码上去。然后推出了非线性码的Berger Be′ery上界。

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.