Identification of lattices from genus of compact surface

In this work we propose procedures for the identification of structure of group associate lattices from fundamental region F4g of regular tessellations {4g; 4g} in the Euclidian plane and hyperbolic plane, where g denote genus of compact surface. © 2006 SBrT.

Special subsets and optimum codes based on lattices and cosets

This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.

On the Optimality of Finite Constellations from Algebraic Lattices

A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a given lattice. For comparison, a numerical table of lattice constellations and group codes is computed for spaces of dimension two, three, and four. © 2001.

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

Commutative group codes in R4, R6, R8 and R16-Approaching the bound

Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices can be determined by a quotient of m-dimensional lattices when the sublattice has an orthogonal basis. We discuss here the existence of orthogonal sublattices of the lattices A2, D3, D4 and E8, which have the best packing density in their dimensions, in order to generate families of commutative group codes approaching the bound presented in Siqueira and Costa (2008) [14]. © 2013 Elsevier B.V. All rights reserved.

A formalized optimum code search for q-ary trellis codes

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Arithmetic fuchsian groups and space time block codes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Stretched-exponential behavior and random walks on diluted hypercubic lattices

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Goppa and Srivastava codes over finite rings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Alternant and BCH codes over certain rings

Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x s - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Zm under Lee metric.

CYCLIC CODES THROUGH B[X], B[X; 1/kp Z(0)] and B[X; 1/p(k) Z(0)]: A COMPARISON

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On a refinement of Craig's lattices

Let p be an odd prime. A family of (p - 1)-dimensional over-lattices yielding new record packings for several values of p in the interval [149... 3001] is presented. The result is obtained by modifying Craig's construction and considering conveniently chosen Z-submodules of Q(zeta), where zeta is a primitive pth root of unity. For p >= 59, it is shown that the center density of the (p - 1)-dimensional lattice in the new family is at least twice the center density of the (p - 1)-dimensional Craig lattice. (C) 2010 Elsevier B.V. All rights reserved.

Constructions of codes through the semigroup ring B[X; 1/2(2)Z(0)] and encoding

For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of B[X; Z(0)] subset of B[X; 1/2(2)Z(0)] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X; 1/2; Z(0)] In this study we developed a construction technique of cyclic codes through a semigroup ring B[X; 1/2(2)Z(0)] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X; 1/2(2)Z(0)]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense. Published by Elsevier Ltd

An Extension of Craig's Family of Lattices

Let p be a prime, and let zeta(p) be a primitive p-th root of unity. The lattices in Craig's family are (p - 1)-dimensional and are geometrical representations of the integral Z[zeta(p)]-ideals < 1 - zeta(p)>(i), where i is a positive integer. This lattice construction technique is a powerful one. Indeed, in dimensions p - 1 where 149 <= p <= 3001, Craig's lattices are the densest packings known. Motivated by this, we construct (p - 1)(q - 1)-dimensional lattices from the integral Z[zeta(pq)]-ideals < 1 - zeta(p)>(i) < 1 - zeta(q)>(j), where p and q are distinct primes and i and fare positive integers. In terms of sphere-packing density, the new lattices and those in Craig's family have the same asymptotic behavior. In conclusion, Craig's family is greatly extended while preserving its sphere-packing properties.

Constructions of algebraic lattices

In this work we present constructions of algebraic lattices in Euclidean space with optimal center density in dimensions 2, 3, 4, 6, 8 and 12, which are rotated versions of the lattices Λn, for n = 2,3,4,6,8 and K12. These algebraic lattices are constructed through twisted canonical homomorphism via ideals of a ring of algebraic integers. Mathematical subject classification: 18B35, 94A15, 20H10.