—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...