DocumentCode
891735
Title
Minimal trellises for block codes
Author
Muder, D.J.
Author_Institution
MITRE Corp., Bedford, MA
Volume
34
Issue
5
fYear
1988
fDate
9/1/1988 12:00:00 AM
Firstpage
1049
Lastpage
1053
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.21228
Filename
21228
Link To Document