Geometrically uniform hyperbolic codes

In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes.

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)

Cation-oxygen interaction and oxygen stability in CaCu3Ti4O12 and CdCu3Ti4O12 lattices

The cubic perovskite related material CaCu3Ti4O12 has attracted a great deal of attention due to the high values of the static dielectric constant, of order 104, approximately constant in the temperature range 100-600 K. The substitution of Ca by Cd results in a similar temperature dependence but a static dielectric constant more than one order of magnitude lower. A theoretical electronic structure study is performed on CaCu3Ti4O12 (CCTO) and CdCu3Ti4O12 (CdCTO) using a tight binding with overlap method. Although the calculations are performed in a paramagnetic configuration, excellent agreement with experiment was found for the calculated band gap of CCTO. In spite of the fact that the band structures of both systems look practically the same, a significant difference is found in the calculated bond strength of Ca-O and Cd-O pairs, driven by the presence of Ti, with Ca-O interaction in CCTO loosened with respect to Cd-O interaction in the cadmium compound. It is suggested that O vacancies are more easily formed in CCTO, this being related to the lower electronegativity of Ca as compared to Cd. The formation of oxygen vacancies could be the origin of the difference in the static dielectric constant of the two compounds.

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and translation-invariant propelinear codes are G-linear codes. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Rural-urban migration in D-dimensional lattices

The rural-urban migration phenomenon is analyzed by using an agent-based computational model. Agents are placed on lattices which dimensions varying from d = 2 up to d = 7. The localization of the agents in the lattice defines that their social neighborhood (rural or urban) is not related to their spatial distribution. The effect of the dimension of lattice is studied by analyzing the variation of the main parameters that characterizes the migratory process. The dynamics displays strong effects even for around one million of sites, in higher dimensions (d = 6, 7).

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)

Band edge states of the < n >=0 gap of Fibonacci photonic lattices

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Anderson localization and Brewster anomalies in photonic disordered quasiperiodic lattices

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

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.

Local dimension and finite time prediction in coupled map lattices

Forecasting, for obvious reasons, often become the most important goal to be achieved. For spatially extended systems (e.g. atmospheric system) where the local nonlinearities lead to the most unpredictable chaotic evolution, it is highly desirable to have a simple diagnostic tool to identify regions of predictable behaviour. In this paper, we discuss the use of the bred vector (BV) dimension, a recently introduced statistics, to identify the regimes where a finite time forecast is feasible. Using the tools from dynamical systems theory and Bayesian modelling, we show the finite time predictability in two-dimensional coupled map lattices in the regions of low BV dimension. © Indian Academy of Sciences.

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.

On the construction and labelling of geometrically uniform signal sets in ℤ2 matched to additive quotient groups

We establish the conditions under which it is possible to construct signal sets satisfying the properties of being geometrically uniform and matched to additive quotient groups. Such signal sets consist of subsets of signal spaces identified to integers rings ℤ[i] and ℤ[ω] in ℤ2. © 2008 KSCAM and Springer-Verlag.