E. Bayer-Fluckiger

Learn More
319 Corollary 4.3: For each possible value , there exists a unique additive dual code H of the extended 1-perfect additive non-4-linear code and all these codes H are pairwise nonequivalent, except for = 0 and = 1, where the codes H coincide with the binary dual of the extended Hamming code. ACKNOWLEDGMENT The authors would like to thank the anonymous(More)
Let k be a field of characteristic = 2, and let L be a Galois extension of k with group G. Let us denote by q L : L × L → k the trace form, defined by q L (x, y) = Tr L/k (xy). Let (gx) g∈G be a normal basis of L over k. We say that this is a self–dual normal basis if q L (gx, hx) = δ g,h. If the order of G is odd, then L always has a self–dual normal basis(More)
— In this work, we give a bound on performance of any full-diversity lattice constellation constructed from algebraic number fields. We show that most of the already available constructions are almost optimal in the sense that any further improvement of the minimum product distance would lead to a neg-ligeable coding gain. Lattice constellations with high(More)