On bit-level trellis complexity of Reed-Muller codes
Chung-Chin Lu, Sy-Hann Huang · IEEE Transactions on Information Theory · 1995
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.