Showing papers presented at "Information Theory Workshop in 1988"

Balancing sets of vectors

Abstract: For n>0, d>or=0, n identical to d (mod 2), let K(n, d) denote the minimal cardinality of a family V of +or-1 vectors of dimension n, such that for any +or-1 vector w of dimension n there is a v in V such that mod v-w mod >

Coset codes. I: Introduction and geometrical classification

Abstract: Practically all known good constructive coding techniques for bandlimited channels, including lattice codes and various trellis-coded modulation schemes, can be characterized as coset codes. A coset code is defined by a lattice partition Lambda / Lambda ' and by a binary encoder C that selects a sequence of cosets of the lattice Lambda '. The fundamental coding gain of a coset code, as well as other important parameters such as the error coefficient, the decoding complexity, and the constellation expansion factor, are purely geometric parameters determined by C Lambda / Lambda '. The known types of coset codes, as well as a number of new classes that systematize and generalize known codes, are classified and compared in terms of these parameters. >