The symmetry group of Z(q)(n) in the Lee space and the Z(qn)-linear codes

The Z(4)-linearity is a construction technique of good binary codes. Motivated by this property, we address the problem of extending the Z(4)-linearity to Z(q)n-linearity. In this direction, we consider the n-dimensional Lee space of order q, that is, (Z(q)(n), d(L)), as one of the most interesting spaces for coding applications. We establish the symmetry group of Z(q)(n) for any n and q by determining its isometries. We also show that there is no cyclic subgroup of order q(n) in Gamma(Z(q)(n)) acting transitively in Z(q)(n). Therefore, there exists no Z(q)n-linear code with respect to the cyclic subgroup.

Hamming and Reed-Solomon codes over certain rings

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

Uniform estimates of attracting sets of extended Lurie systems using LMIs

This research presents a systematic procedure to obtain estimates, via extended Lyapunov functions, of attracting sets of a class of nonlinear systems, as well as an estimate of their stability regions. The considered class of nonlinear systems, called in this note the extended Lurie system, consists of nonlinear systems like those of the Lurie problem where one of the nonlinear functions can violate the sector conditions of the Lurie problem around the origin. In case of nonautonomous systems the concept of absolute stability is extended and uniform estimates of the attracting set are obtained. Two classical nonlinear systems, the forced duffing equation and the Van der Pol system, are analyzed with the proposed procedure.

Embedded crack elements with non-uniform discontinuity modes

The consequences of the use of embedded crack finite elements with uniform discontinuity modes (opening and sliding) to simulate crack propagation in concrete are investigated. It is shown the circumstances in which the consideration of uniform discontinuity modes is not suitable to accurately model the kinematics induced by the crack and must be avoided. It is also proposed a technique to embed cracks with non-uniform discontinuity modes into standard displacement-based finite elements to overcome the shortcomings of the uniform discontinuity modes approach.

On the construction of perfect codes from HEX signal constellations

Recently, minimum and non-minimum delay perfect codes were proposed for any channel of dimension n. Their construction appears in the literature as a subset of cyclic division algebras over Q(zeta(3)) only for the dimension n = 2(s)n(1), where s is an element of {0,1}, n(1) is odd and the signal constellations are isomorphic to Z[zeta(3)](n) In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over Q(zeta(3)), where the signal constellations are isomorphic to the hexagonal A(2)(n)-rotated lattice, for any channel of any dimension n such that gcd(n,3) = 1. (C) 2012 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Quantum rings of arbitrary shape and non-uniform width in a threading magnetic field

The electronic states of quantum rings with centerlines of arbitrary shape and non-uniform width in a threading magnetic field are calculated. The solutions of the Schrodinger equation with Dirichlet boundary conditions are obtained by a variational separation of variables in curvilinear coordinates. We obtain a width profile that compensates for the main effects of the curvature variations in the centerline. Numerical results are shown for circular, elliptical, and limacon-shaped quantum rings. We also show that smooth and tiny variations in the width may strongly affect the Aharonov-Bohm oscillations.

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.

Preparation and characterization of uniform, spherical particles of Y2O2S and Y2O2S:Eu

The preparation of spherical Y2O2S and Y2O2S:Eu particles using a solid-gas reaction of monodispersed precursors with elemental sulfur vapor under an argon atmosphere has been investigated. The precursors, undoped and doped yttrium basic carbonates, are synthesized by aging a stock solution containing the respective cation chloride and urea at 82-84 °C. Y2O2S and Y2O2S:Eu were characterized in terms of their composition, crystallinity and morphology by chemical analysis, X-ray powder diffraction (XRD), IR spectroscopy, and scanning electron microscopy (SEM). The Eu-doped oxysulfide was also characterized by atomic absorption spectrophotometry and luminescence spectroscopy. The spherical morphology of oxysulfide products and of basic carbonate precursors suggests a topotatic inter-relationship between both compounds.

Construction and decoding of BCH codes over finite commutative rings

BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.

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.

COX24 codes for a mitochondrial protein required for processing of the COX1 transcript

In most strains of Saccharomyces cerevisiae the mitochondrial gene COX1, for subunit 1 of cytochrome oxidase, contains multiple exons and introns. Processing of COX1 primary transcript requires accessory proteins factors, some of which are encoded by nuclear genes and others by reading frames residing in some of the introns of the COX1 and COB genes. Here we show that the low molecular weight protein product of open reading frame YLR204W, for which we propose the name COX24, is also involved in processing of COX1 RNA intermediates. The growth defect of cox24 mutants is partially rescued in strains harboring mitochondrial DNA lacking introns. Northern blot analyses of mitochondrial transcripts indicate cox24 null mutants to be blocked in processing of introns aI2 and aI3. The dependence of intron aI3 excision on Cox24p is also supported by the growth properties of the cox24 mutant harboring mitochondrial DNA with different intron compositions. The intermediate phenotype of the cox24 mutant in the background of intronless mitochondrial DNA, however, suggests that in addition to its role in splicing of the COX1 pre-mRNA, Cox24p still has another function. Based on the analysis of a cox14-cox24 double mutant, we propose that the other function of Cox24p is related to translation of the COX1 mRNA. © 2006 by The American Society for Biochemistry and Molecular Biology, Inc.

A general technique to embed non-uniform discontinuities into standard solid finite elements

A general technique to embed non-uniform displacement discontinuities into standard solid finite elements is presented. The technique is based on the decomposition of the kinematic fields into a component related to the deformation of the solid portion of the element and one related to the rigid-body motion due to a displacement discontinuity. This decomposition simplifies the incorporation of discontinuity interfaces and provides a suitable framework to account for non-uniform discontinuity modes. The present publication addresses two families of finite element formulations: displacement-based and stress hybrid finite element. © 2005 Elsevier Ltd. All rights reserved.

Evolutionary modeling of larval dispersal in blowflies using non-uniform cellular automata

When the food supply flnishes, or when the larvae of blowflies complete their development and migrate prior to the total removal of the larval substrate, they disperse to find adequate places for pupation, a process known as post-feeding larval dispersal. Based on experimental data of the Initial and final configuration of the dispersion, the reproduction of such spatio-temporal behavior is achieved here by means of the evolutionary search for cellular automata with a distinct transition rule associated with each cell, also known as a nonuniform cellular automata, and with two states per cell in the lattice. Two-dimensional regular lattices and multivalued states will be considered and a practical question is the necessity of discovering a proper set of transition rules. Given that the number of rules is related to the number of cells in the lattice, the search space is very large and an evolution strategy is then considered to optimize the parameters of the transition rules, with two transition rules per cell. As the parameters to be optimized admit a physical interpretation, the obtained computational model can be analyzed to raise some hypothetical explanation of the observed spatiotemporal behavior. © 2006 IEEE.