A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.

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.

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.

Hamming and Reed-Solomon codes over certain rings

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

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.

In situ differentiation of labile/inert metal species in Brazilian tropical rivers by means of a time-controlled batch-procedure based on TEPHA resin

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

Alternative procedure for the cold test for soybean seeds

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

Treatment of PVC using an alternative low energy ion bombardment procedure

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

Efficient procedure to evaluate electromagnetic transients on three-phase transmission lines

This paper presents a hybrid way mixing time and frequency domain for transmission lines modelling. The proposed methodology handles steady fundamental signal mixed with fast and slow transients, including impulsive and oscillatory behaviour. A transmission line model is developed based on lumped elements representation and state-space techniques. The proposed methodology represents an easy and practical procedure to model a three-phase transmission line directly in time domain, without the explicit use of inverse transforms. The proposed methodology takes into account the frequency-dependent parameters of the line, considering the soil and skin effects. In order to include this effect in the state matrices, a fitting method is applied. Furthermore the accuracy of proposed the developed model is verified, in frequency domain, by a simple methodology based on line distributed parameters and transfer function related to the input/output signals of the lumped parameters representation. In addition, this article proposes the use of a fast and robust analytic integration procedure to solve the state equations, enabling transient and steady-state simulations. The results are compared with those obtained by the commercial software Microtran (EMTP), taking into account a three-phase transmission line, typical in the Brazilian transmission system.

Relação entre habilidades auditivas e fonológicas em crianças com dislexia do desenvolvimento

A dislexia do desenvolvimento, dificuldade específica de leitura, é caracterizada pela dificuldade em realizar a decodificação fono-grafêmica e percepção de fonemas acusticamente semelhantes. Este estudo teve como objetivo caracterizar o desempenho de crianças com dislexia quanto às habilidades auditivas e de consciência fonológica, correlacionando-as. Participaram deste estudo crianças com dislexia e com bom desempenho escolar, submetidas a avaliações audiológica, do processamento auditivo e das habilidades fonológicas. Os resultados indicaram diferença estatisticamente significante entre as habilidades auditivas de seqüência para sons verbais, mensagem competitiva ipsi e contra-lateral, dicótico de dígitos e dissílabos alternados e ainda nos subtestes de síntese, segmentação, manipulação e transposição. Os achados deste estudo evidenciaram correlação entre provas de memória auditiva e manipulação silábica e fonêmica e associação entre habilidades auditivas e fonológicas, sugerindo que os processos auditivos interferem diretamente na percepção de aspectos acústicos, temporais e seqüenciais dos sons para formação de uma representação fonológica estável.

Typing class I HLA-A gene using a nested PCR-RFLP procedure

In order to detect several new HLA-A class I alleles that have been described since 1998, the original PCR-RFLP method developed to identify the 78 alleles recognized at that time at high resolution level was adapted by us for low and medium resolution levels using a nested PCR-RFLP approach. The results obtained from blood samples of 23 subjects using both the PCR-RFLP method and a commercial kit (MicroSSP1A®, One Lambda Inc.) showed an agreement higher than 95%. The PCR-RFLP adapted method was effective in low and medium resolution histocompatibility evaluations.

Analytical procedure based on slurry sampling for determining selenium in organic vegetable samples by graphite furnace atomic absorption spectrometry

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

Microdilution procedure for antifungal susceptibility testing of Paracoccidioides brasiliensis to amphotericin B and itraconazole

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