Study on the trellis complexity of a few types of linear block codes
Xinmei Wang · Journal of China Institute of Communications · 2001
The trellis complexities s(C) of a few types of linear block codes C[n,k,d]are inveshgated. The trellis compelxities of two types of linear block codes whose code lewi is odd are shown. In the meantime some results are shown on the trellis complexity of t-error-cortechng primitive BCH codes [2m-1,2m-1-mt] and their extended pridrive BCH codes. Thus finding the dbect-sum structure of codes is avoided before we solve the suboptimal upper bound of their trellis complexity.