40 resultados para Linear Codes over Finite Fields

em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Adaptació de l'algorisme de Kumar per resoldre sistemes d'equacions amb matrius de Toeplitz sobre els reals a cossos finits en un temps 0 (n log n).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper is devoted to the study of the volcanoes of l-isogenies of elliptic curves over a finite field, focusing on their height as well as on the location of curves across its different levels. The core of the paper lies on the relationship between the l-Sylow subgroup of an elliptic curve and the level of the volcano where it is placed. The particular case l = 3 is studied in detail, giving an algorithm to determine the volcano of 3-isogenies of a given elliptic curve. Experimental results are also provided.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

"Vegeu el resum a l'inici del document del fitxer adjunt."

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper derives approximations allowing the estimation of outage probability for standard irregular LDPC codes and full-diversity Root-LDPC codes used over nonergodic block-fading channels. Two separate approaches are discussed: a numerical approximation, obtained by curve fitting, for both code ensembles, and an analytical approximation for Root-LDPC codes, obtained under the assumption that the slope of the iterative threshold curve of a given code ensemble matches the slope of the outage capacity curve in the high-SNR regime.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We introduce several exact nonparametric tests for finite sample multivariatelinear regressions, and compare their powers. This fills an important gap inthe literature where the only known nonparametric tests are either asymptotic,or assume one covariate only.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

En aquest projecte es presenta el desenvolupament d'un paquet d'aplicacions en l'entorn de programació matemàtica Magma, per al tractament dels codis anomenats Z2Z4-additius. Els codis Z2Z4-additius permeten representar alguns codis binaris, com a codis lineals en l'espai dels codis Z2Z4-additius. Aquest fet permetrà l'estudi de tota una sèrie de codis binaris no lineals que fins ara eren intractables.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Linear response functions are implemented for a vibrational configuration interaction state allowing accurate analytical calculations of pure vibrational contributions to dynamical polarizabilities. Sample calculations are presented for the pure vibrational contributions to the polarizabilities of water and formaldehyde. We discuss the convergence of the results with respect to various details of the vibrational wave function description as well as the potential and property surfaces. We also analyze the frequency dependence of the linear response function and the effect of accounting phenomenologically for the finite lifetime of the excited vibrational states. Finally, we compare the analytical response approach to a sum-over-states approach

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The recent theory of Tsironis and Grigolini for the mean first-passage time from one metastable state to another of a bistable potential for long correlation times of the noise is extended to large but finite correlation times.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We study the properties of (K) over bar* mesons in nuclear matter using a unitary approach in coupled channels within the framework of the local hidden gauge formalism and incorporating the (K) over bar pi decay channel in matter. The in-medium (K) over bar *N interaction accounts for Pauli blocking effects and incorporates the (K) over bar* self-energy in a self-consistent manner. We also obtain the (K) over bar* (off-shell) spectral function and analyze its behavior at finite density and momentum. At a normal nuclear matter density, the (K) over bar* meson feels a moderately attractive potential, while the (K) over bar* width becomes five times larger than in free space. We estimate the transparency ratio of the gamma A -> K+K*(-) A` reaction, which we propose as a feasible scenario at the present facilities to detect changes in the properties of the (K) over bar* meson in nuclear medium.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this article we present a detailed analysis of the kinetics of a class of sequential adsorption models that take into account the effect of externally applied fields (as an electric field, or a shear rate) on the adsorption. The excluded volume interactions related to the finite size of the adsorbing particles are modified by the external fields. As a result, new adsorption mechanisms appear with respect to the ones used to describe the kinetics in a quiescent fluid. In particular, if the adsorbing particles are allowed to roll over preadsorbed ones, adsorption becomes non local even in the simplest geometry. An exact analytic theory cannot be developed, but we introduce a self-consistent theory that turns out to agree with the simulation results over all the range of the parameters.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this article we present a detailed analysis of the kinetics of a class of sequential adsorption models that take into account the effect of externally applied fields (as an electric field, or a shear rate) on the adsorption. The excluded volume interactions related to the finite size of the adsorbing particles are modified by the external fields. As a result, new adsorption mechanisms appear with respect to the ones used to describe the kinetics in a quiescent fluid. In particular, if the adsorbing particles are allowed to roll over preadsorbed ones, adsorption becomes non local even in the simplest geometry. An exact analytic theory cannot be developed, but we introduce a self-consistent theory that turns out to agree with the simulation results over all the range of the parameters.