Outage thresholds of LDPC codes over nonergodic block-fading channels

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.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

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.

Encryption methods using formal power series rings

Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.

Full diversity product codes for block erasure and block fading channels

We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.

Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.

Freedom of choice as control over outcomes

As interactions between individuals are introduced into the freedom of choice literature by the mean of game forms, new issues appear. In particular, in this paper it is argued that individuals face uncertainty with respect to outcomes as they lose the control they implicitely exert over options in the opportunity set framework. A criterion is proposed as to compare alternative game forms in terms of the control they offer to individuals. The CardMin criterion suggests that any game form should be judged on the basis of the strategy offering the lowest number of pairwise different outcomes. An axiomatic characterization is provided in the case of two individuals.

Projective modules over the Gerasimov-Sakhaev counterexample

We investigate the structure of the so-called Gerasimov- Sakhaev counterexample, which is a particular example of a universal localization, and classify (both finitely and infinitely generated) projective modules over it.

Effects of competition over quality-adjusted price indexes: an application to the Spanish automobile market

Using a newly constructed data set, we calculate quality-adjusted price indexes after estimating hedonic price regressions from 1988 to 2004 in the Spanish automobile market. The increasing competition was favoured by the removal of trade restrictions and the special plans for the renewal of the Spanish automobile fleet. We find that the increasing degree of competition during those years led to an overall drop in automobile prices by 20 percent which implied considerable consumer gains thanks to higher market efficiency. Additionally, our results indicate that loyalty relevance and discrepancies in automobile reliability declined during those years. This is captured.

Codes of best practice in competitive markets for managers

We study firms' corporate governance in environments where possibly heterogeneous shareholders compete for possibly heterogeneous managers. A firm, formed by a shareholder and a manager, can sign either an incentive contract or a contract including a Code of Best Practice. A Code allows for a better manager's control but makes manager's decisions hard to react when market conditions change. It tends to be adopted in markets with low volatility and in low-competitive environments. The firms with the best projects tend to adopt the Code when managers are not too heterogeneous while the best managers tend to be hired through incentive contracts when the projects are similar. Although the matching between shareholders and managers is often positively assortative, the shareholders with the best projects might be willing to renounce to hire the best managers, signing contracts including Codes with lower-ability managers.

Applying RADIC in Open MPI: the methodology used to implement RADIC over a Message Passing Library

Fault tolerance has become a major issue for computer and software engineers because the occurrence of faults increases the cost of using a parallel computer. RADIC is the fault tolerance architecture for message passing systems which is transparent, decentralized, flexible and scalable. This master thesis presents the methodology used to implement the RADIC architecture over Open MPI, a well-know large-used message passing library. This implementation kept the RADIC architecture characteristics. In order to validate the implementation we have executed a synthetic ping program, besides, to evaluate the implementation performance we have used the NAS Parallel Benchmarks. The results prove that the RADIC architecture performance depends on the communication pattern of the parallel application which is running. Furthermore, our implementation proves that the RADIC architecture could be implemented over an existent message passing library.

Localization of algebras over coloured operads

We give sufficient conditions for homotopical localization functors to preserve algebras over coloured operads in monoidal model categories. Our approach encompasses a number of previous results about preservation of structures under localizations, such as loop spaces or infinite loop spaces, and provides new results of the same kind. For instance, under suitable assumptions, homotopical localizations preserve ring spectra (in the strict sense, not only up to homotopy), modules over ring spectra, and algebras over commutative ring spectra, as well as ring maps, module maps, and algebra maps. It is principally the treatment of module spectra and their maps that led us to the use of coloured operads (also called enriched multicategories) in this context.

Creation of a carrier-grade telco based on a voice over IP backbone

En aquesta memòria l'autor, fent servir un enfoc modern, redissenya i implementa la plataforma que una empresa de telecomunicacions del segle 21 necessita per poder donar serveis de telefonia i comunicacions als seus usuaris i clients. Al llarg d'aquesta exposició es condueix al lector des d'una fase inicial de disseny fins a la implementació i posada en producció del sistema final desenvolupat, centrant-nos en solucionar les necessitats actuals que això implica. Aquesta memòria cubreix el software, hardware i els processos de negoci associats al repte de fer realitat aquest objectiu, i presenta al lector les múltiples tecnologies emprades per aconseguir-ho, fent emfàsi en la convergència actual de xarxes cap al concepte de xarxes IP i basant-se en aquesta tendència i utilitzant aquesta tecnologia de veu sobre IP per donar forma a la plataforma que finalment, de forma pràctica, es posa en producció.

Persistent bundles over a two dimensional compact set

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