The theory of cyclic-group codes for the Gaussian channel is reviewed, and the following new results are shown: i) the initial vector problem for these codes can be formulated as a linear programming problem, and ii) the codeword generation and the
1 November 1976 in IEEE Transactions on Information Theory
A lower bound to the number of AND gates used in parallel multipliers for GF(2/sup m/), under the condition that time complexity be minimum, is determined. In particular, the exact minimum number of AND gates for primitive normal bases and optimal normal bases of Type II multipliers is evaluated. This result indirectly suggests that space complexity is essentially a quadratic function of m when time complexity is kept minimum.
A number of theorems are given, which give insight into the algebraic structure of group codes for the Gaussian channel, as defined by Slepian. The problem of the existence of group codes for a given pair of defining parameters (i.e., number of codewordsM, and dimension of the signal spacen) is partially solved.
16 December 2011 in Applicable Algebra in Engineering, Communication and Computing