DocumentCode
1087257
Title
On bit-level trellis complexity of Reed-Muller codes
Author
Lu, Chung-Chin ; Huang, Sy-Hann
Author_Institution
Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Volume
41
Issue
6
fYear
1995
fDate
11/1/1995 12:00:00 AM
Firstpage
2061
Lastpage
2064
Abstract
A formula, which relates the state dimensions of a minimal trellis of a Reed-Muller code to those of another Reed-Muller code with lower order and shorter length, is derived. The state dimension at every position of a minimal trellis of any Reed-Muller code can be obtained by a recursive application of this formula
Keywords
Reed-Muller codes; computational complexity; trellis codes; Reed-Muller codes; bit-level trellis complexity; length; minimal trellis; order; recursive application; state dimensions; Australia; Block codes; Code standards; Information theory; Terminology; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.476337
Filename
476337
Link To Document