In this paper we present a novel and efficient maximum-likel ihood soft-decision decoding algorithm for linear block codes. The approach used here converts the decoding problem into a search problem through a graph that is a trellis for an equivalent code of the transmitted code. A general ized Dijkstra’s Algorithm, which uses a priority-first search strategy, is employed to search through this...

Arc consistency algorithms are widely used to prune the search space of Constraint Satisfaction Problems (CSPs). Since many researchers associate arc consistency with binary normalized CSPs, there is a confusion between the notion of arc consistency and 2-consistency. 2-consistency guarantees that any instantiation of a value to a variable can be consistently extended to any second variable. Th...

Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for rn-dependent random variables . Examples include : the number of leaves (La ), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left de...

Let $n (>3)$ be a prime number and notation="LaTeX">${\mathbb {F}}_{2^{n}}$ finite field of notation="LaTeX">$2^{n}$ elements. notation="LaTeX">$L ={\mathbb {F}}_{2^{n}}\cup \{\infty \}$ the support set notation="LaTeX">$g(x)$ an i...

In this paper, we propose to extend the Peril-L parallel pseudo-code language. The extensions added to the Peril-L are essential to express non-trivial parallel algorithms. We demonstrate the effectiveness of the extended Peril-L by showing the parallel algorithms for the Jacobi method for solving differential equations and the dynamic programming method for finding the optimal binary search tree.

We introduce the Distributed Guided Local Search (DistGLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in order to enhance its efficiency in distributed scenarios. We discuss the strategies we use for dealing with local optima in the search for solutions ...

The largest minimum weight of a self-dual doubly-even binary (n, k, d) code is d = 4bn/24c+ 4. Of such codes with length divisible by 24, the Golay Code is the only (24, 12, 8) code, the Extended Quadratic Residue Code is the only known (48, 24, 12) code, and there is no known (72, 36, 16) code. One may partition the search for a (48, 24, 12) self-dual doubly-even code into 3 cases. A previous ...