Goppa codes over certain semigroups

A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.

A Note on Linear Codes over Semigroup Rings

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.

Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA

This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over binary Galois Field (ECC- GF(2m)). The purpose of our coprocessor is to accelerate the scalar multiplication performed over elliptic curve points represented by affine coordinates in polynomial basis. Our method consists of using elliptic curve parameters over GF(2163) in accordance with international security requirements to implement a bit-parallel coprocessor on field-programmable gate-array (FPGA). Our coprocessor performs modular inversion by using a process based on the Stein's algorithm. Results are presented and compared to results of other related works. We conclude that our coprocessor is suitable for comparing with any other ECC-hardware proposal, since its speed is comparable to projective coordinate designs.

Schur-Szegö composition of entire functions

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

Fourier series for quaternions and the square of the error theorem

In this paper we introduce a type of Hypercomplex Fourier Series based on Quaternions, and discuss on a Hypercomplex version of the Square of the Error Theorem. Since their discovery by Hamilton (Sinegre [1]), quaternions have provided beautifully insights either on the structure of different areas of Mathematics or in the connections of Mathematics with other fields. For instance: I) Pauli spin matrices used in Physics can be easily explained through quaternions analysis (Lan [2]); II) Fundamental theorem of Algebra (Eilenberg [3]), which asserts that the polynomial analysis in quaternions maps into itself the four dimensional sphere of all real quaternions, with the point infinity added, and the degree of this map is n. Motivated on earlier works by two of us on Power Series (Pendeza et al. [4]), and in a recent paper on Liouville’s Theorem (Borges and Mar˜o [5]), we obtain an Hypercomplex version of the Fourier Series, which hopefully can be used for the treatment of hypergeometric partial differential equations such as the dumped harmonic oscillation.

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}$.

Feed digestion of growing Saanen goats

Pós-graduação em Zootecnia - FCAV

Modelagem das trajetórias médias do peso vivo e do rendimento de carcaça de tilápias do Nilo (Oreochromis niloticus) por meio de funções B-spline

Employing the method of least squares and quadratic B-spline polynomials, different statistical models were tested to identify the most appropriate to model the mean trajectories of live weight and carcass yield of Nile tilapia (Oreochromis niloticus). Data of live weight (8,758) and carcass yield (2,042) of tilapias with ages between 106 and 245 days were obtained from 72 families derived from 36 males and 72 females. The sex and tank variables were considered as classificatory and the coefficients of quadratic polynomials B-spline of two to five intervals of the same size were used as covariables. According to most fit criteria used, the models with quadratic B-spline polynomial with five intervals of the same size presented the best adjustments. The increase in number of intervals of B-spline polynomial improved the fit of the polynomials to the data. The inclusion of classificatory effects from sex, tank, the interaction of these effects and the quadratic polynomial B-spline nested in this interaction indicated that, over time, each sex, grown in different tank, presented different mean trajectory, necessitating the inclusion of nesting time in the interaction sex x tank in order to avoid the under or overestimation of breeding values of the selection candidates in breeding programs of this species.

Reologia de fluidos envolvidos no processo de obtenção de bioetanol

Pós-graduação em Engenharia e Ciência de Alimentos - IBILCE

Zeros de Polinômios Auto-Recíprocos Reais no Círculo Unitário

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Equação de Fokker-Planck e enovelamento de proteínas

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

Classification of histological images based on the stationary wavelet transform

Non-Hodgkin lymphomas are of many distinct types, and different classification systems make it difficult to diagnose them correctly. Many of these systems classify lymphomas only based on what they look like under a microscope. In 2008 the World Health Organisation (WHO) introduced the most recent system, which also considers the chromosome features of the lymphoma cells and the presence of certain proteins on their surface. The WHO system is the one that we apply in this work. Herewith we present an automatic method to classify histological images of three types of non-Hodgkin lymphoma. Our method is based on the Stationary Wavelet Transform (SWT), and it consists of three steps: 1) extracting sub-bands from the histological image through SWT, 2) applying Analysis of Variance (ANOVA) to clean noise and select the most relevant information, 3) classifying it by the Support Vector Machine (SVM) algorithm. The kernel types Linear, RBF and Polynomial were evaluated with our method applied to 210 images of lymphoma from the National Institute on Aging. We concluded that the following combination led to the most relevant results: detail sub-band, ANOVA and SVM with Linear and RBF kernels.

A class of cubic Rauzy fractals

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

Zero sets of bivariate Hermite polynomials

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

Lysine requirements of laying hens

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