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)

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.

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.

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.

Espectrofotometria de longo caminho óptico em espectrofotô metro de duplo-feixe convencional: uma alternativa simples para investigações de amostras com densidade óptica muito baixa

We describe the design and tests of a set-up mounted in a conventional double beam spectrophotometer, which allows the determination of optical density of samples confined in a long liquid core waveguide (LCW) capillary. Very long optical path length can be achieved with capillary cell, allowing measurements of samples with very low optical densities. The device uses a custom optical concentrator optically coupled to LCW (TEFLON® AF). Optical density measurements, carried out using a LCW of ̃ 45 cm, were in accordance with the Beer-Lambert Law. Thus, it was possible to analyze quantitatively samples at concentrations 45 fold lower than that regularly used in Spectrophotometric measurements.

Encoding through generalized polynomial codes

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

Integrating open source codes for solid modeling and automatic mesh generation in FEM applications

The applications of the Finite Element Method (FEM) for three-dimensional domains are already well documented in the framework of Computational Electromagnetics. However, despite the power and reliability of this technique for solving partial differential equations, there are only a few examples of open source codes available and dedicated to the solid modeling and automatic constrained tetrahedralization, which are the most time consuming steps in a typical three-dimensional FEM simulation. Besides, these open source codes are usually developed separately by distinct software teams, and even under conflicting specifications. In this paper, we describe an experiment of open source code integration for solid modeling and automatic mesh generation. The integration strategy and techniques are discussed, and examples and performance results are given, specially for complicated and irregular volumes which are not simply connected. © 2011 IEEE.

The cultural industry and new codes of modernity

Includes bibliography

Construction of perfect space-time codes

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 ℚ(ζ3), where the signal constellations are isomorphic to the hexagonal An 2 -rotated lattice, for any channel of any dimension n such that gcd{n, 3) = 1.

Códigos, reglamentos y normas sobre abastecimiento de agua, saneamiento y eliminación de desechos sólidos con especial atención a las necesidades de las comunidades de bajos ingresos en América Latina y el Caribe = Codes, regulations and standards on water supply, sanitation and solid-waste disposal with emphasis on low-income community requirements in Latin America and the Caribbean

Incluye Bibliografía

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.

Draft working paper on country codes for use in processing external trade statistics

Describe un sistema de codificación de países y regiones para ser usado en el procesamiento de estadísticas de comercio exterior; analiza las deficiencias de los códigos de países existentes en el área del CARICOM; y presenta en anexos dos esquemas de clasificación.