On the application of parallel architectures to a class of operations research problems
On the asymptotic rate of non-ergodic information sources
On the Automorphism Groups of some AG-Codes Based on Ca;b Curves
*Partially supported by NATO.We study Ca,b curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how Ca;b curves can be used to construct MDS codes and focus on some Ca;b curves with extra automorphisms, namely y^3 = x^4 + 1, y^3 = x^4 - x, y^3 - y = x^4. The automorphism groups of such codes are determined in most characteristics.
On the branching property of entropy
On the capacity of asymptotically mean stationary channels
On the classification of 3-dimensional non-associative division algebras over -adic fields
Let be a prime and a -adic field (a finite extension of the field of -adic numbers ). We employ the main results in [12] and the arithmetic of elliptic curves over to reduce the problem of classifying 3-dimensional non-associative division algebras (up to isotopy) over to the classification of ternary cubic forms over (up to equivalence) with no non-trivial zeros over . We give an explicit solution to the latter problem, which we then relate to the reduction type of the jacobian...
On the coding theorem for decomposable discrete information channels. I
On the coding theorem for decomposable discrete information channels. II
On the complexity of the hidden weighted bit function for various BDD models
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
Ordered binary decision diagrams (OBDDs) and several more general BDD models have turned out to be representations of Boolean functions which are useful in applications like verification, timing analysis, test pattern generation or combinatorial optimization. The hidden weighted bit function (HWB) is of particular interest, since it seems to be the simplest function with exponential OBDD size. The complexity of this function with respect to different circuit models, formulas, and various...
On the computation of covert channel capacity
We address the problem of computing the capacity of a covert channel, modeled as a nondeterministic transducer. We give three possible statements of the notion of “covert channel capacity” and relate the different definitions. We then provide several methods allowing the computation of lower and upper bounds for the capacity of a channel. We show that, in some cases, including the case of input-deterministic channels, the capacity of the channel can be computed exactly (e.g. in the form...
On the computational complexity of centers locating in a graph
It is shown that the problem of finding a minimum -basis, the -center problem, and the -median problem are -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal -center problem is also -complete.
On the connection between the theory of signal flow graphs and the theory of directed graphs
On the Construction of Codes from an Asymptotically Good Tower over F8
In 2002, van der Geer and van der Vlugt gave explicit equations for an asymptotically good tower of curves over the field F8. In this paper, we will present a method for constructing Goppa codes from these curves as well as explicit constructions for the third level of the tower. The approach is to find an associated plane curve for each curve in the tower and then to use the algorithms of Haché and Le Brigand to find the corresponding Goppa codes.
On the construction of dense lattices with a given automorphisms group
We consider the problem of constructing dense lattices in with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions , we exhibit a finite set of lattices that come with an automorphisms group of size , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...
On the degree of finite maximal biprefix codes.
On the detection of a complex finite binary sequence in the presence of an interfering complex binary sequence
On the diameter of matroid ports.
On the differential and residual entropy
On the distribution of the elliptic subset sum generator of pseudorandom numbers.