Studies on error linear complexity measures for multisequences

Ph.DDOCTOR OF PHILOSOPH

ANALYSIS OF SECURITY MEASURES FOR SEQUENCES

Stream ciphers are private key cryptosystems used for security in communication and data transmission systems. Because they are used to encrypt streams of data, it is necessary for stream ciphers to use primitives that are easy to implement and fast to operate. LFSRs and the recently invented FCSRs are two such primitives, which give rise to certain security measures for the cryptographic strength of sequences, which we refer to as complexity measures henceforth following the convention. The linear (resp. N-adic) complexity of a sequence is the length of the shortest LFSR (resp. FCSR) that can generate the sequence. Due to the availability of shift register synthesis algorithms, sequences used for cryptographic purposes should have high values for these complexity measures. It is also essential that the complexity of these sequences does not decrease when a few symbols are changed. The k-error complexity of a sequence is the smallest value of the complexity of a sequence obtained by altering k or fewer symbols in the given sequence. For a sequence to be considered cryptographically ‘strong’ it should have both high complexity and high error complexity values. An important problem regarding sequence complexity measures is to determine good bounds on a specific complexity measure for a given sequence. In this thesis we derive new nontrivial lower bounds on the k-operation complexity of periodic sequences in both the linear and N-adic cases. Here the operations considered are combinations of insertions, deletions, and substitutions. We show that our bounds are tight and also derive several auxiliary results based on them. A second problem on sequence complexity measures useful in the design and analysis of stream ciphers is to determine the number of sequences with a given fixed (error) complexity value. In this thesis we address this problem for the k-error linear complexity of 2n-periodic binary sequences. More specifically: 1. We characterize 2n-periodic binary sequences with fixed 2- or 3-error linear complexity and obtain the counting function for the number of such sequences with fixed k-error linear complexity for k = 2 or 3. 2. We obtain partial results on the number of 2n-periodic binary sequences with fixed k-error linear complexity when k is the minimum number of changes required to lower the linear complexity

Peak to average power ratio reduction and error control in MIMO-OFDM HARQ System

Currently, multiple-input multiple-output orthogonal frequency division multiplexing (MIMOOFDM) systems underlie crucial wireless communication systems such as commercial 4G and 5G networks, tactical communication, and interoperable Public Safety communications. However, one drawback arising from OFDM modulation is its resulting high peak-to-average power ratio (PAPR). This problem increases with an increase in the number of transmit antennas. In this work, a new hybrid PAPR reduction technique is proposed for space-time block coding (STBC) MIMO-OFDM systems that combine the coding capabilities to PAPR reduction methods, while leveraging the new degree of freedom provided by the presence of multiple transmit chairs (MIMO). In the first part, we presented an extensive literature review of PAPR reduction techniques for OFDM and MIMO-OFDM systems. The work developed a PAPR reduction technique taxonomy, and analyzed the motivations for reducing the PAPR in current communication systems, emphasizing two important motivations such as power savings and coverage gain. In the tax onomy presented here, we include a new category, namely, hybrid techniques. Additionally, we drew a conclusion regarding the importance of hybrid PAPR reduction techniques. In the second part, we studied the effect of forward error correction (FEC) codes on the PAPR for the coded OFDM (COFDM) system. We simulated and compared the CCDF of the PAPR and its relationship with the autocorrelation of the COFDM signal before the inverse fast Fourier transform (IFFT) block. This allows to conclude on the main characteristics of the codes that generate high peaks in the COFDM signal, and therefore, the optimal parameters in order to reduce PAPR. We emphasize our study in FEC codes as linear block codes, and convolutional codes. Finally, we proposed a new hybrid PAPR reduction technique for an STBC MIMO-OFDM system, in which the convolutional code is optimized to avoid PAPR degradation, which also combines successive suboptimal cross-antenna rotation and inversion (SS-CARI) and iterative modified companding and filtering schemes. The new method permits to obtain a significant net gain for the system, i.e., considerable PAPR reduction, bit error rate (BER) gain as compared to the basic MIMO-OFDM system, low complexity, and reduced spectral splatter. The new hybrid technique was extensively evaluated by simulation, and the complementary cumulative distribution function (CCDF), the BER, and the power spectral density (PSD) were compared to the original STBC MIMO-OFDM signal

Structural approaches to protein sequence analysis

Various protein sequence analysis techniques are described, aimed at improving the prediction of protein structure by means of pattern matching. To investigate the possibility that improvements in amino acid comparison matrices could result in improvements in the sensitivity and accuracy of protein sequence alignments, a method for rapidly calculating amino acid mutation data matrices from large sequence data sets is presented. The method is then applied to the membrane-spanning segments of integral membrane proteins in order to investigate the nature of amino acid mutability in a lipid environment. Whilst purely sequence analytic techniques work well for cases where some residual sequence similarity remains between a newly characterized protein and a protein of known 3-D structure, in the harder cases, there is little or no sequence similarity with which to recognize proteins with similar folding patterns. In the light of these limitations, a new approach to protein fold recognition is described, which uses a statistically derived pairwise potential to evaluate the compatibility between a test sequence and a library of structural templates, derived from solved crystal structures. The method, which is called optimal sequence threading, proves to be highly successful, and is able to detect the common TIM barrel fold between a number of enzyme sequences, which has not been achieved by any previous sequence analysis technique. Finally, a new method for the prediction of the secondary structure and topology of membrane proteins is described. The method employs a set of statistical tables compiled from well-characterized membrane protein data, and a novel dynamic programming algorithm to recognize membrane topology models by expectation maximization. The statistical tables show definite biases towards certain amino acid species on the inside, middle and outside of a cellular membrane

Microbial ecology of biotechnological processes

The investigation of phylogenetic diversity and functionality of complex microbial communities in relation to changes in the environmental conditions represents a major challenge of microbial ecology research. Nowadays, particular attention is paid to microbial communities occurring at environmental sites contaminated by recalcitrant and toxic organic compounds. Extended research has evidenced that such communities evolve some metabolic abilities leading to the partial degradation or complete mineralization of the contaminants. Determination of such biodegradation potential can be the starting point for the development of cost effective biotechnological processes for the bioremediation of contaminated matrices. This work showed how metagenomics-based microbial ecology investigations supported the choice or the development of three different bioremediation strategies. First, PCR-DGGE and PCR-cloning approaches served the molecular characterization of microbial communities enriched through sequential development stages of an aerobic cometabolic process for the treatment of groundwater contaminated by chlorinated aliphatic hydrocarbons inside an immobilized-biomass packed bed bioreactor (PBR). In this case the analyses revealed homogeneous growth and structure of immobilized communities throughout the PBR and the occurrence of dominant microbial phylotypes of the genera Rhodococcus, Comamonas and Acidovorax, which probably drive the biodegradation process. The same molecular approaches were employed to characterize sludge microbial communities selected and enriched during the treatment of municipal wastewater coupled with the production of polyhydroxyalkanoates (PHA). Known PHA-accumulating microorganisms identified were affiliated with the genera Zooglea, Acidovorax and Hydrogenophaga. Finally, the molecular investigation concerned communities of polycyclic aromatic hydrocarbon (PAH) contaminated soil subjected to rhizoremediation with willow roots or fertilization-based treatments. The metabolic ability to biodegrade naphthalene, as a representative model for PAH, was assessed by means of stable isotope probing in combination with high-throughput sequencing analysis. The phylogenetic diversity of microbial populations able to derive carbon from naphthalene was evaluated as a function of the type of treatment

Rendiconti dell'Istituto di Matematica dell'Università di Trieste. An International Journal of Mathematics. Vol. 44 (2012)

Rendiconti dell’Istituto di Matematica dell’Università di Trieste was founded in 1969 by Arno Predonzan, with the aim of publishing original research articles in all fields of mathematics and has been the first Italian mathematical journal to be published also on-line. The access to the electronic version of the journal is free. All published articles are available on-line. The journal can be obtained by subscription, or by reciprocity with other similar journals. Currently more than 100 exchange agreements with mathematics departments and institutes around the world have been entered in