46 resultados para Decoding principle

em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"


Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

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

Relevância:

60.00% 60.00%

Publicador:

Resumo:

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.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A precise fomulation of the strong Equivalence Principle is essential to the understanding of the relationship between gravitation and quantum mechanics. The relevant aspects are reviewed in a context including General Relativity but allowing for the presence of torsion. For the sake of brevity, a concise statement is proposed for the Principle: An ideal observer immersed in a gravitational field can choose a reference frame in which gravitation goes unnoticed. This statement is given a clear mathematical meaning through an accurate discussion of its terms. It holds for ideal observers (time-like smooth non-intersecting curves), but not for real, spatially extended observers. Analogous results hold for gauge fields. The difference between gravitation and the other fundamental interactions comes from their distinct roles in the equation of force.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Massive particles of spin 0 and 1 violate the equivalence principle (EP) at the tree level. on the other hand, if these particles are massless, they agree with the EP, which leads us to conjecture that from a semiclassical viewpoint massless particles, no matter what their spin, obey the EP. General relativity predicts a deflection angle of 2.63' for a nonrelativistic spinless massive boson passing close to the Sun, while for a massive vectorial boson of spin 1 the corresponding deflection is 2.62'.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In a recent paper, we raised a question on the validity of Feynman's prescription of disregarding the Pauli principle in intermediate states of perturbation theory. In the preceding Comment, Cavalcanti correctly pointed out that Feynman's prescription is consistent with the exact solution of the model that we used. This means that the Pauli principle does not necessarily apply to intermediate states. We discuss implications of this puzzling aspect.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the general relativistic description of gravitation, geometry replaces the concept of force. This is possible because of the universal character of free fall, and would break down in its absence. on the other hand, the teleparallel version of general relativity is a gauge theory for the translation group and, as such, describes the gravitational interaction by a force similar to the Lorentz force of electromagnetism, a non-universal interaction. Relying on this analogy it is shown that, although the geometric description of general relativity necessarily requires the existence of the equivalence principle, the teleparallel gauge approach remains a consistent theory for gravitation in its absence.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Regarding the Pauli principle in quantum field theory and in many-body quantum mechanics, Feynman advocated that Pauli's exclusion principle can be completely ignored in intermediate states of perturbation theory. He observed that all virtual processes (of the same order) that violate the Pauli principle cancel out. Feynman accordingly introduced a prescription, which is to disregard the Pauli principle in all intermediate processes. This ingenious trick is of crucial importance in the Feynman diagram technique. We show, however, an example in which Feynman's prescription fails. This casts doubts on the general validity of Feynman's prescription. [S1050-2947(99)04604-1].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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