Minimal trellises for block codes

Basic concepts in the study of trellises of block codes are defined. It is shown that minimal proper trellises exists for all block codes. Bounds on the size of such trellises are established. These bounds are shown to be exact for maximum distance separable codes and nearly so for perfect codes. >