Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM

This paper derives the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasi-static frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhaustive search approach can be used for low memory order STTC with small frame size. However with moderate memory order STTC and moderate frame size the computational cost of exhaustive search increases exponentially, and may become impractical for high memory order STTCs. This requires advanced computational techniques such as Genetic Algorithms (GAS). In this paper, a GA with sharing function method is used to locate the multiple solutions of the distance spectrum for high memory order STTCs. Simulation evaluates the performance union bound and the complexity comparison of non-GA aided and GA aided distance spectrum techniques. It shows that the union bound give a close performance measure at high signal-to-noise ratio (SNR). It also shows that GA sharing function method based distance spectrum technique requires much less computational time as compared with exhaustive search approach but with satisfactory accuracy.

An upper bound on the Bayesian error bars for generalized linear regression

In the Bayesian framework, predictions for a regression problem are expressed in terms of a distribution of output values. The mode of this distribution corresponds to the most probable output, while the uncertainty associated with the predictions can conveniently be expressed in terms of error bars. In this paper we consider the evaluation of error bars in the context of the class of generalized linear regression models. We provide insights into the dependence of the error bars on the location of the data points and we derive an upper bound on the true error bars in terms of the contributions from individual data points which are themselves easily evaluated.

MHC class I bound to an immunodominant Theileria parva epitope demonstrates unconventional presentation to T cell receptors

T cell receptor (TCR) recognition of peptide-MHC class I (pMHC) complexes is a crucial event in the adaptive immune response to pathogens. Peptide epitopes often display a strong dominance hierarchy, resulting in focusing of the response on a limited number of the most dominant epitopes. Such T cell responses may be additionally restricted by particular MHC alleles in preference to others. We have studied this poorly understood phenomenon using Theileria parva, a protozoan parasite that causes an often fatal lymphoproliferative disease in cattle. Despite its antigenic complexity, CD8+ T cell responses induced by infection with the parasite show profound immunodominance, as exemplified by the Tp1(214-224) epitope presented by the common and functionally important MHC class I allele N*01301. We present a high-resolution crystal structure of this pMHC complex, demonstrating that the peptide is presented in a distinctive raised conformation. Functional studies using CD8+ T cell clones show that this impacts significantly on TCR recognition. The unconventional structure is generated by a hydrophobic ridge within the MHC peptide binding groove, found in a set of cattle MHC alleles. Extremely rare in all other species, this feature is seen in a small group of mouse MHC class I molecules. The data generated in this analysis contribute to our understanding of the structural basis for T cell-dependent immune responses, providing insight into what determines a highly immunogenic p-MHC complex, and hence can be of value in prediction of antigenic epitopes and vaccine design.

Error-correcting codes that nearly saturate Shannon's bound

Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different code rates in both finite and infinite message length.

Tighter decoding reliability bound for Gallager's error-correcting code

Statistical physics is employed to evaluate the performance of error-correcting codes in the case of finite message length for an ensemble of Gallager's error correcting codes. We follow Gallager's approach of upper-bounding the average decoding error rate, but invoke the replica method to reproduce the tightest general bound to date, and to improve on the most accurate zero-error noise level threshold reported in the literature. The relation between the methods used and those presented in the information theory literature are explored.

An exploratory study of the utilisation of the UK's Prudential Borrowing Framework

This article considers the utilisation of the UK’s Prudential Borrowing Framework (PBF) and the associated Prudential Code for local government capital finance. It finds that the increased flexibility and local freedom are at the cost of less financial certainty in terms of the risks borne by local authorities and local tax payers. The PBF seems to encourage a less formal approach to risk, being considered inevitable and handled if and when adverse risk outcomes occur. Consequently capital projects may lack affordability, sustainability and prudence. The Prudential Indicators required by the Code are not easily understood by non-specialists and their calculation cannot be used to replace sound judgement or to identify the best financing option.