Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from L binary code components. If the component codes are linear, then the minimum distance is the same for all the points, although the kissing number may vary. In fact, while in the single level (L = 1) case it reduces to lattice Construction A, a multi-level Construction C is in general not a lattice. We show that the two-level (L = 2) case is special: a two-level Construction C satisfies Forney's definition for a geometrically uniform constellation. Specifically, every point sees the same configuration of neighbors, up to a reflection of the coordinates in which the lower level code is equal to 1. ...
We extend Piret's upper bound [1] to codes over uniform signal sets (a signal set is referred to be ...
There is a rich theory of relations between lattices and linear codes over finite fields. However, t...
The action of a noise operator on a code transforms it into a distribution on the respective space. ...
A variety of new Euclidean codes are investigated. These codes are suitable for discrete-time Gaussi...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
The theory of geometrically uniform signal sets and codes over groups is applied to the case of LxMP...
Abstract- We extend Piret's u p p e r bound [l] to codes over uniform signal sets (a signal set...
lattice codes for communication over additive white Gaussian noise (AWGN) channels. We introduce Con...
International audienceIn this article we revisit smoothing bounds in parallel between lattices and c...
Abstract Certain classes of binary constant weight codes can be represented geometrically using line...
International audienceThe problem of communicating over the additive white Gaussian noise (AWGN) cha...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
AbstractA binary linear code in F2n with dimension k and minimum distance d is called an [n,k,d] cod...
In this article we revisit smoothing bounds in parallel between lattices and codes. Initially introd...
In order to study circuit complexity classes within NC¹ in a uniform setting, we need a uniformity c...
We extend Piret's upper bound [1] to codes over uniform signal sets (a signal set is referred to be ...
There is a rich theory of relations between lattices and linear codes over finite fields. However, t...
The action of a noise operator on a code transforms it into a distribution on the respective space. ...
A variety of new Euclidean codes are investigated. These codes are suitable for discrete-time Gaussi...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
The theory of geometrically uniform signal sets and codes over groups is applied to the case of LxMP...
Abstract- We extend Piret's u p p e r bound [l] to codes over uniform signal sets (a signal set...
lattice codes for communication over additive white Gaussian noise (AWGN) channels. We introduce Con...
International audienceIn this article we revisit smoothing bounds in parallel between lattices and c...
Abstract Certain classes of binary constant weight codes can be represented geometrically using line...
International audienceThe problem of communicating over the additive white Gaussian noise (AWGN) cha...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
AbstractA binary linear code in F2n with dimension k and minimum distance d is called an [n,k,d] cod...
In this article we revisit smoothing bounds in parallel between lattices and codes. Initially introd...
In order to study circuit complexity classes within NC¹ in a uniform setting, we need a uniformity c...
We extend Piret's upper bound [1] to codes over uniform signal sets (a signal set is referred to be ...
There is a rich theory of relations between lattices and linear codes over finite fields. However, t...
The action of a noise operator on a code transforms it into a distribution on the respective space. ...