Construções euclidianas e o desfecho de problemas famosos da geometria

Construction techniques with ruler and the compasses, fundamental on Euclidean geometry, have been related to modern algebraic theories such as solving equations and extension of bodies from the works by Paolo Ruffini (1765-1822), Niels Henrik Abel (1802-1829) and Evariste Galois (1811-1832). This relation could provide an answer to some famous problems, from ancient Greece, such as doubling the cube, the trisection Angle, the Quadrature of the Circle and the construction of regular polygons, which remained unsolved for over two thousand years. Also important for our purposes are the notions of algebraic numbers, transcendental and the criteria for constructability, of those numbers. The objective of this study is to reconstruct relevant steps of geometric constructions with ruler (unmarked) and the compasses, from the elementary to the outcome buildings, in the nineteenth century, considering those mentioned problems.

Construction and decoding of BCH codes over chain of commutative rings

In this paper, we present a new construction and decoding of BCH codes over certain rings. Thus, for a nonnegative integer t, let A0 ⊂ A1 ⊂···⊂ At−1 ⊂ At be a chain of unitary commutative rings, where each Ai is constructed by the direct product of appropriate Galois rings, and its projection to the fields is K0 ⊂ K1 ⊂···⊂ Kt−1 ⊂ Kt (another chain of unitary commutative rings), where each Ki is made by the direct product of corresponding residue fields of given Galois rings. Also, A∗ i and K∗ i are the groups of units of Ai and Ki, respectively. This correspondence presents a construction technique of generator polynomials of the sequence of Bose, Chaudhuri, and Hocquenghem (BCH) codes possessing entries from A∗ i and K∗ i for each i, where 0 ≤ i ≤ t. By the construction of BCH codes, we are confined to get the best code rate and error correction capability; however, the proposed contribution offers a choice to opt a worthy BCH code concerning code rate and error correction capability. In the second phase, we extend the modified Berlekamp-Massey algorithm for the above chains of unitary commutative local rings in such a way that the error will be corrected of the sequences of codewords from the sequences of BCH codes at once. This process is not much different than the original one, but it deals a sequence of codewords from the sequence of codes over the chain of Galois rings.

Uma construção de códigos BCH

Um código BCH C (respectivamente, um código BCH C 0 ) de comprimento n sobre o anel local Zp k (respectivamente, sobre o corpo Zp) é um ideal no anel Zpk [X] (Xn−1) (respectivamente, no anel Zp[X] (Xn−1) ), que ´e gerado por um polinômio mônico que divide Xn−1. Shankar [1] mostrou que as raízes de Xn−1 são as unidades do anel de Galois GR(p k , s) (respectivamente, corpo de Galois GF(p, s)) que é uma extensão do anel Zp k (respectivamente, do corpo Zp), onde s é o grau de um polinômio irredutível f(X) ∈ Zp k [X]. Neste estudo, assumimos que para si = b i , onde b é um primo e i é um inteiro não negativo tal que 0 ≤ i ≤ t, existem extensões de anéis de Galois correspondentes GR(p k , si) (respectivamente, extensões do corpo de Galois GF(p, si)) do anel Zp k (respectivamente, do corpo Zp). Assim, si = b i para i = 2 ou si = b i para i > 2. De modo análogo a [1], neste trabalho, apresentamos uma sequência de códigos BCH C0, C1, · · · , Ct−1C sobre Zp k de comprimentos n0, n1, · · · , nt−1, nt , e uma sequência de códigos BCH C 0 0 , C0 1 , · · · , C0 t−1 , C0 sobre Zp de comprimentos n0, n1, · · · , nt−1, nt , onde cada ni divide p si − 1. Palavras Chave: Anel de Galois, corpo de Galois, código BCH.

A note on units of finite local rings in an ascending chain

In this paper we present matrices over unitary finite commutative local rings connected through an ascending chain of containments, whose elements are units of the corresponding rings in the chain such that the McCoy ranks are the largest ones.

Linear codes over finite local rings in a chain

For a positive integer $t$, let \begin{equation*} \begin{array}{ccccccccc} (\mathcal{A}_{0},\mathcal{M}_{0}) & \subseteq & (\mathcal{A}_{1},\mathcal{M}_{1}) & \subseteq & & \subseteq & (\mathcal{A}_{t-1},\mathcal{M}_{t-1}) & \subseteq & (\mathcal{A},\mathcal{M}) \\ \cap & & \cap & & & & \cap & & \cap \\ (\mathcal{R}_{0},\mathcal{M}_{0}^{2}) & & (\mathcal{R}_{1},\mathcal{M}_{1}^{2}) & & & & (\mathcal{R}_{t-1},\mathcal{M}_{t-1}^{2}) & & (\mathcal{R},\mathcal{M}^{2}) \end{array} \end{equation*} be a chain of unitary local commutative rings $(\mathcal{A}_{i},\mathcal{M}_{i})$ with their corresponding Galois ring extensions $(\mathcal{R}_{i},\mathcal{M}_{i}^{2})$, for $i=0,1,\cdots,t$. In this paper, we have given a construction technique of the cyclic, BCH, alternant, Goppa and Srivastava codes over these rings. Though, initially in \cite{AP} it is for local ring $(\mathcal{A},\mathcal{M})$, in this paper, this new approach have given a choice in selection of most suitable code in error corrections and code rate perspectives.

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.

Fields of two power conductor

The goal of this work is find a description for fields of two power conductor. By the Kronecker-Weber theorem, these amounts to find the subfields of cyclotomic field $\mathbb{Q}(\xi_{2^r})$, where $\xi_{2^r}$ is a $2^r$-th primitive root of unit and $r$ a positive integer. In this case, the cyclotomic extension isn't cyclic, however its Galois group is generated by two elements and the subfield can be expressed by $\mathbb{Q}(\theta)$ for a $\theta\in\mathbb{Q}(\xi_{2^r})$ convenient.

Codificação de canais em sistemas de comunicação sem fio baseado em reticulados

Pós-graduação em Engenharia Elétrica - FEIS

Anéis de inteiros de corpos de números e aplicações

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

The modification of structural and optical properties of nano- and submicron ZnO powders by variation of solvothermal syntheses conditions

Nano- (30-60 nm) and submicron (100-350 nm) ZnO particles were synthesized using solvothermal method at 200 degrees C from an ethanolic solution of zinc acetate dihydrate, applying different reaction conditions, i.e., pH value of precursor and time of the reaction. The X-ray diffraction (XRD), field emission scanning electron microscopy (FE-SEM), transmission electron microscopy (TEM), UV-vis diffuse reflectance (DR), Raman spectroscopy, and photoluminescence (PL) spectroscopy have been employed for characterization of synthesized ZnO powders. It was shown that the structural, morphological, and optical properties are largely determined by reaction conditions during solvothermal synthesis. The particle crystallinity improves with the decrease of pH value and/or the increase of time of the reaction. The Raman and PL spectra analyses indicate that the oxygen interstitials are dominant intrinsic defects in solvothermally synthesized ZnO powders. It was observed that concentration of defects in wurtzite ZnO crystal lattices slightly changes with the variation of pH value of the precursor and time of the solvothermal reaction. The correlation between structural ordering and defect structure of particles and corresponding growth processes was discussed.

MnO4(3-) NIR luminescence in Ba2SiO4

Ba2SiO4: MnO43- luminescence is reported and compared to similar host lattices based on PO43-, VO43- and AsO43-, where Mn5+ substitutes for p(5+),V5+ Or AS(5+). The observed energy position of MnO43- 1E state in SiO44- is in accordance with interelectronic repulsion caused by Mn5+-O bond length. At 77 K the E-1 splitting is 119 cm(-1), which is in agreement with 1.8 degrees, the average deviation of O-M-O angles from the regular tetrahedron. These values are adjusted to Ca point symmetry. The vibronic-structure spectra evidenced a progression with a frequency assigned to the nu(2)(E) bending mode of MnO43-.

A formalized optimum code search for q-ary trellis codes

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

Ordered phases in the extended Hubbard model

A novel method to probe the diverse phases for the extended Hubbard model (EHM), including the correlated hopping term, is presented. We extend an effective medium approach [1] to a bipartite lattice, allowing for charge- and/or spin-ordered phases. We calculate the necessary correlation functions to build the EHM phase diagram.

Phase transition from a d(x(2)-y(2)) to d(x(2)-y(2))+id(xy) superconductor

The temperature dependencies of specific heat and spin susceptibility of a coupled dx2-y2 + idxy superconductor in the presence of a weak dxy component are investigated in the tight-binding model (1) on square lattice and (2) on a lattice with orthorhombic distortion. As the temperature is lowered past the critical temperature Tc, first a less ordered dx2-y2 superconductor is created, which changes to a more ordered dx2-y2 + idxy superconductor at Tcl(< Tc). This manifests in two second order phase transitions identified by two jumps in specific heat at Tc and Tc1. The temperature dependencies of the superconducting observables exhibit a change from power-law to exponential behavior as temperature is lowered below Tc1 and confirm the new phase transition. © 1998 Published by Elsevier Science B.V. All rights reserved.

Tópicos de teoria dos números algébricos e aplicações em reticulados e equações diofantinas

Pós-graduação em Matemática Universitária - IGCE