This paper presents a simple and very accurate method to evaluate the error probability of bit-interleaved coded modulation. Modelling the channel as a binaryinput continuous-output channel with a non-Gaussian transition density allows for the application of standard bounding techniques for Gaussian channels. The pairwise error probability is equal to the tail probability of a sum of random var...

A new class of integer sequences is introduced in which any pair of identical symbols in the sequence, separated a certain number of digits apart, appears in the sequence, with that separation, at most once. For any given sequence length n and number of distinct symbols used, m, such a sequence, if it exists, is not unique; our attention is thus focused on the lexographically first such sequenc...

The pairwise comparisonsmethod is a convenient tool used when the relative order among different concepts (alternatives) needs to be determined. One popular implementation of the method is based on solving an eigenvalue problem for the pairwise comparisons matrix. In such cases the ranking result the principal eigenvector of the pairwise comparisonmatrix is adopted, whilst the eigenvalue is use...

Borel summation techniques are developed to obtain exact invariants from formal adiabatic invariants (given as divergent series in a small parameter) for a class of differential equations, under assumptions of analyticity of the coefficients; the method relies on the study of associated partial differential equations in the complex plane. The type and location of the singularities of these asso...

A general algorithmic approach to the construction of optimal designs, using the columnwise-pairwise (CP) procedures, was recently proposed (Li and Wu 1995; Li 1996a). This presentation shows several areas to which the new techniques can be applied: optimal non-orthogonal designs, design repair problem, optimal mixed-level designs, and optimal Latin-hypercubes. Each optimal design is constructe...

A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and sorting the pairs into lexicographic order.

To solve a number of problems on varieties of groups, stated by Kleiman, Kuznetsov, Ol’shanskii, Shmel’kin in the 1970’s and 1980’s, we construct continuously many varieties of groups in which all periodic groups are abelian and whose pairwise intersections are the variety of all abelian groups.

We introduce a procedure called ‘reverse engineering’ which can be used to construct infinite families of smooth 4-manifolds in a given homeomorphism type. As one of the applications of this technique, we produce an infinite family of pairwise nondiffeomorphic 4-manifolds homeomorphic to S × S.

Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segment in S crosses at most three edges of T .

in this paper, we discuss strong laws for weighted sums of pairwise negatively dependent random variables. the results on i.i.d case of soo hak sung [9] are generalized and extended.