Project co-funded by the European Commission within the 6th Framework Programme Dissemination Level PU Public X PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services) The information in this do...

1. Introduction In this paper we consider some results on the orbits of groups of collineations, or, more generally, on the point and block classes of tactical decompositions, on symmetric balanced incomplete block designs (symmetric BIBD = (v, k, 2)-system=finite 2-plane), and we consider generalizations to (not necessarily symmetric) BIBD and other combinatorial designs. The results are about...

water quality prediction is a valuable tool for pollutant control in aquatic environments. a river system is selected and one-dimensional flow is assumed for the simulation of pollutant transport in this paper. advective and diffusive terms of transport equation are considered separately. different functions of advective transport are proposed and applied for a specified velocity on the discret...

We present an expectation-maximization method for optimizing Markov process transition probabilities to increase the mutual information rate achievable when the Markov process is transmitted over a noisy finitestate machine channel. The method provides a tight lower bound on the achievable information rate of a Markov process over a noisy channel and it is conjectured that it actually maximizes...

Polar coding is a new technique introduced by Arıkan [1] based on a phenomenon called channel polarization. Polar codes are appealing as an error correction method since they are proved to achieve the symmetric capacity of any B-DMC using low complexity encoders and decoders, and their block error probability is shown to decrease exponentially in the square root of the block length. In fact, tw...

Suppose X is a uniformly distributed n-dimensional binary vector and Y is obtained by passing X through a binary symmetric channel with crossover probability α. A recent conjecture by Courtade and Kumar postulates that I(f(X);Y ) ≤ 1− h(α) for any Boolean function f . In this paper, we prove the conjecture for all α ∈ [0, αn], and under the restriction to balanced functions, also for all α ∈ [1...

In this paper, we investigate the undetected error probabilities for bounded-distance decoding of binary primitive BCH codes when they are used for both error correction and detection on a binary symmetric channel. We show that the undetected error probability of binary linear codes can be quite simplified and quantified if weight distribution of the code is binomial-like. We obtain bounds on t...