39 resultados para Galois extensions of local commutative rings
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Let epsilon be a commutative ring with identity and P is an element of epsilon[x] be a polynomial. In the present paper we consider digit representations in the residue class ring epsilon[x]/(P). In particular, we are interested in the question whether each A is an element of epsilon[x]/(P) can be represented modulo P in the form e(0)+ e(1)x + ... + e(h)x(h), where the e(i) is an element of epsilon[x]/(P) are taken from a fixed finite set of digits. This general concept generalizes both canonical number systems and digit systems over finite fields. Due to the fact that we do not assume that 0 is an element of the digit set and that P need not be monic, several new phenomena occur in this context.
Resumo:
Local anesthetic agents cause temporary blockade of nerve impulses productiong insensitivity to painful stimuli in the area supplied by that nerve. Bupivacaine (BVC) is an amide-type local anesthetic widely used in surgery and obstetrics for sustained peripheral and central nerve blockade. in this study, we prepared and characterized nanosphere formulations containing BVC. To achieve these goals, BVC loaded poly(DL-lactide-co-glycolide) (PLGA) nanospheres (NS) were prepared by nanopreciptation and characterized with regard to size distribution, drug loading and cytotoxicity assays. The 2(3-1) factorial experimental design was used to study the influence of three different independent variables on nanoparticle drug loading. BVC was assayed by HPLC, the particle size and zeta potential were determined by dynamic light scattering. BVC was determined using a combined ultrafiltration-centrifugation technique. The results of optimized formulations showed a narrow size distribution with a polydispersivity of 0.05%, an average diameter of 236.7 +/- 2.6 nm and the zeta potential -2.93 +/- 1,10 mV. In toxicity studies with fibroblast 3T3 cells, BVC loaded-PLGA-NS increased cell viability, in comparison with the effect produced by free BVC. In this way, BVC-loaded PLGA-NS decreased BVC toxicity. The development of BVC formulations in carriers such as nanospheres could offer the possibility of controlling drug delivery in biological systems, prolonging the anesthetic effect and reducing toxicity.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The boundary conditions of the bosonic string theory in non-zero B-field background are equivalent to the second class constraints of a discretized version of the theory. By projecting the original canonical coordinates onto the constraint surface we derive a set of coordinates of string that are unconstrained. These coordinates represent a natural framework for the quantization of the theory.
Resumo:
We show that the extension of the approximate custodial SU(2)(L+R) global symmetry to all the Yukawa interactions of the standard model Lagrangian implies the introduction of sterile right-handed neutrinos and the seesaw mechanism in this sector. In this framework, the observed quark and lepton masses may be interpreted as an effect of physics beyond the standard model. The mechanism used for breaking this symmetry in the Yukawa sector could be different from the one at work in the vector boson sector. We give three model independent examples of these mechanisms.
Resumo:
Stationary states of an electron in thin GaAs elliptical quantum rings are calculated within the effective-mass approximation. The width of the ring varies smoothly along the centerline, which is an ellipse. The solutions of the Schrödinger equation with Dirichlet boundary conditions are approximated by a product of longitudinal and transversal wave functions. The ground-state probability density shows peaks: (i) where the curvature is larger in a constant-with ring, and (ii) in thicker parts of a circular ring. For rings of typical dimensions, it is shown that the effects of a varying width may be stronger than those of the varying curvature. Also, a width profile which compensates the main localization effects of the varying curvature is obtained.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)