Title :
Minimal trellises for block codes
Author_Institution :
MITRE Corp., Bedford, MA
fDate :
9/1/1988 12:00:00 AM
Abstract :
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
Keywords :
codes; block codes; maximum distance separable codes; minimal trellises; perfect codes; Block codes; Combinatorial mathematics; Decoding; Graph theory; Hamming distance; Length measurement; Linear code; Multiprocessor interconnection networks; Size measurement; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
