Channel coding systems that employ linear block codes can be designed according to a mean-square error criterion. The optimum encoder and decoder pair is determined by selecting special elements in a generalized frequency domain based upon the values of key parameters called ratio weights. Systems may be designed that employ either hard or soft decision variables in the decoder. When cyclic codes are used, a minimal ideal decomposition of the code space shows that the ratio weights possess constant values on certain subsets in the frequency domain. This permits a drastic reduction in the number of ratio weights that need to be computed. For a cyclic code with t minimal ideals, this design procedure narrows the search for constancy subsets of the ratio weights to (2^{t}-1) subsets of the general space. Only one ratio weight needs to be computed for each constancy subset.
[1]
G. Robert Redinbo.
Optimum symbol-by-symbol mean-square error channel coding
,
1979,
IEEE Trans. Inf. Theory.
[2]
G. Redinbo,et al.
The Design and Implementation of Unequal Error-Correcting Coding Systems
,
1982,
IEEE Trans. Commun..
[3]
Neal Zierler.
On the MacWilliams Identity
,
1973,
J. Comb. Theory, Ser. A.
[4]
G. Robert Redinbo,et al.
The optimum mean-square estimate for decoding binary block codes
,
1974,
IEEE Trans. Inf. Theory.
[5]
G. Robert Redinbo.
Optimum Soft Decision Decoding With Graceful Degradation
,
1979,
Inf. Control..
[6]
G. Robert Redinbo.
The Optimum Mean-Square Decoding of General Block Codes
,
1976,
Inf. Control..