This paper concentrates on a class of pseudorandom sequences generated by combining q-ary m-sequences and quadratic characters over finite field odd order, called binary generalized NTU sequences. It is shown that the relationship among sub-sequences can be formulated as combinatorial structures Hadamard designs. As consequence, generalize group structure discovered Kodera et al. (IEICE Trans. ...

In this paper we compute the number of reduced decompositions of certain permutations ∈ Sn as a product of transpositions (1; 2), (1; 3), : : :, (1; n). We present several combinatorial correspondences between these decompositions and combinatorial objects such as Catalan paths and k-ary trees. c © 1999 Elsevier Science B.V. All rights reserved

In this work, we propose a visual, custom-designed, event-driven interconnect simulation framework to evaluate the performance of off-chip multi-processor/memory communications architectures for line cards. The simulator uses the state-of-the-art software design techniques to provide the user with a flexible, robust and comprehensive tool that can evaluate k-ary n-cube based network topologies ...

fuzzy rough n-ary subhypergroups are introduced and characterized.

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.

We devise a condition strictly between the existence of an $n$-ary and $n{+}1$-ary near-unanimity term. evaluate exactly distributivity modularity levels implied by such condition.

Considering the problem of IP multicast implementation in routers, in recent years, a lot of alternative methods have been introduced of the application layer multicast (ALM), for one-tomany content distribution. The present study aims to provide a new Algorithm in the field of ALM, to reduce the delay in peer to peer content distribution network (P2P), based on cooperation of M-ary and cluster...

An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...