Minimal Trellises for Two Classes of Linear Codes

Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.