Hamming and Reed-Solomon codes over certain rings

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

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.

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)

Faddeev-jackiw formalism for A topological-like oscillator in planar dimensions

The problem of a harmonic oscillator coupling to an electromagnetic potential plus a topological-like (Chern-Simons) massive term, in two-dimensional space, is studied in the light of the symplectic formalism proposed by Faddeev and Jackiw for constrained systems.

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.

Pre-weighted homogeneous map germs finite determinacy and topological triviality

In this paper we introduce the notion of G-pre-weighted homogeneous map germ, (G is one of Mather's groups A or K.) and show that any G-pre-weighted homogeneous map germ is G-finitely determined. We also give an explicit order, based on the Newton polyhedron of a pre-weighted homogeneous germ of function, such that the topological structure is preserved after perturbations by terms of higher order.

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.

Can one cure the nonunitarity of three-dimensional quadratic gravity using a topological Chern-Simons term?

Quadratic gravity in (2+1)D is nonunitarity at the tree level. When a topological Chern-Simons term is added to this theory, the harmless massive scalar mode of the former gives rise to a troublesome massive spin-0 ghost, while the massive spin-2 ghost is replaced by two massive physical particles both of spin-2. Therefore, unlike what it is claimed in the literature, quadratic Chern-Simons gravity in (2+1)D is nonunitary at the tree level. © 2004 Published by Elsevier B.V.

Pure spinor formalism as an N ≤ 2 topological string

Following suggestions of Nekrasov and Siegel, a non-minimal set of fields are added to the pure spinor formalism for the superstring. Twisted ĉ ≤ 3 N ≤ 2 generators are then constructed where the pure spinor BRST operator is the fermionic spin-one generator, and the formalism is interpreted as a critical topological string. Three applications of this topological string theory include the super-Poincaré covariant computation of multiloop superstring amplitudes without picture-changing operators, the construction of a cubic open superstring field theory without contact-term problems, and a new four-dimensional version of the pure spinor formalism which computes F-terms in the spacetime action. © SISSA 2005.

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.

The Rv1712 locus from Mycobacterium tuberculosis H37Rv codes for a functional CMP kinase that preferentially Phosphorylates dCMP

The Mycobacterium tuberculosis cmk gene, predicted to encode a CMP kinase (CMK), was cloned and expressed, and its product was purified to homogeneity. Steady-state kinetics confirmed that M. tuberculosis CMK is a monomer that preferentially phosphorylates CMP and dCMP by a sequential mechanism. A plausible role for CMK is discussed. Copyright © 2009, American Society for Microbiology. All Rights Reserved.

Encoding through generalized polynomial codes

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