Berlekamp and Zigangirov completely determined the capacity error function for binary correcting codes with noiseless feedback. It is still an unsolved problem if upper bound in non-binary case of Ahlswede, Lebedev, Deppe sharp. We consider wraparound channels limited magnitude determine all q -ary a level r . All our algorithms use partial Furthermore, special equivalent to Shannon’s zero-erro...

We present two new constructions of entanglement-assisted quantum error-correcting codes using some fundamental properties (classical) linear in an effective way. The main ideas include complementary dual and related concatenation constructions. Numerical examples modest lengths show that our perform better than known the literature. also give a proof on generalization binary Singleton type bou...

This article describes an approach to solving distributed constraint optimization problems (DCOP) with n-ary constraints. A key instance of this problem is distributed resource-constrained task scheduling, in which limited resource capacities implicitly imply n-ary relations among the start-times of the tasks. We describe ADOPT-N, an extension of ADOPT [16], a recent successful algorithm for DC...

The main topics of this paper are the structure of Sidelnikov sequences and new construction of M ary sequence families from the structure. For prime p and a positive integer m, it is shown that M -ary Sidelnikov sequences of period p − 1, if M | pm − 1, can be equivalently generated by the operation of elements in a finite field GF(p), including a p-ary m-sequence. The equivalent representatio...

we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...

polygroups are multivalued systems that satisfy group like axioms. in this paper the class of n-arypolygroups is introduced. the concepts of n-ary normal subpolygroups and strong homomorphisms of n-arypolygroups are adopted. with respect to these concepts the isomorphism theorems for n-ary polygroups arestated and proved. finally, we will consider the fundamental relation  * defined on an n-ar...

We extend the Action-Oberon language for executing action systems with type-bound actions. Type-bound actions combine the concepts of type-bound procedures (methods) and actions, bringing object orientation to action systems. Type-bound actions are created at runtime along with the objects of their bound types. They permit the encapsulation of data and code in objects. Allowing an action to hav...

We present a divide-and-conquer algorithm for merging k sorted lists, namely, recursively merge the first lists, do likewise for the last lists, then merge the two results. We get a tight bound for the expense, in comparisons made between list elements, of this merge. We show the algorithm is cheapest among all similar divide-and-conquer approaches to k-way merging. We compute the expense of th...

This paper is devoted to the generation and evaluation of the Chaos-based M-ary spreading sequences on communications systems. Sequences obtained by repeating a truncated and multi-ary quantized chaotic series are compared with classical m-sequences by means of the autocorrelation and cross-correlation properties and power-spectral features. Anti-noise performance of binary sequences and chaoti...