In this paper, we enhance the performance efficiency of free-space optical (FSO) communication link using hybrid on-off keying (OOK) modulation, M-ary digital pulse position modulation (M-ary DPPM), and M-pulse amplitude (M-PAPM). This work analyzes enhances bit error rate (BER) moment generating function, modified Chernoff bound, Gaussian approximation techniques. existence both an amplified s...

In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.

A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programming relax and the upper bound of the optimal value and the best feasible solution at present were found and renewed with particle swarm optimization (PSO). It is shown by the numerical results that ...

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the is (i) expanding and (ii) well-spread, (iii) certain random variable on boundary of ball has tail. As applications, we show that volume intersection Hamming, Johnson spaces symmetric groups decay exponentially as their centers drift apart. To verify conditio...

There is a common agreement in the scientiic community that ad-aptive routing algorithms will eventually replace the deterministic ones that are currently in use in multicomputer networks. An open issue in this research area is to determine the optimal degree of ad-aptivity that the routing algorithm should provide. Through simulation on a 16-ary 2-cube, we analyze some minimal wormhole algorit...

Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary capacities. We define key notions such as Möbius transform, derivative, Shapley value and Choquet integral.