In this paper, for a prime number , a construction method to generate -ary -form sequences with the ideal autocorrelation property is proposed and using the ternary sequences found by Helleseth, Kumar, and Martinsen, ternary -form sequences with the ideal autocorrelation property are constructed. By combining the methods for generating -ary extended sequences (a special case of geometric sequen...

Coherent M-ary ASK is proposed to be used in OFDM systems. The frequency separation between subcarriers is only 1/2T instead of 1/T. With a slightly wider bandwidth, an M -ary ASK-OFDM can achieve the same BER of M-ary QAM-OFDM and a better BER than that of MPSK-OFDM. The M -ary ASK-OFDM has the same Peak-To-Average-Power Ratio (PAPR) as that of the M-ary QAM-OFDM. The MASKOFDM can be implement...

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks, including the ring, the torus and the hypercube, that are attractive in both theoretical interests and practical systems can be regarded as the subclasses of the k-ary n-cubes. In this paper, we investigate the fault tolerant cycle e...

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...

Transform domain communication system (TDCS) has been proposed as a new kind of intelligent wireless communication system, which has the advantages of adaptive interference avoidance capability and low probability of intercept (LPI). Different from the traditional communication system suppressing interference at the receiver, TDCS synthesizes an adaptive fundamental modulation waveform (FMW) in...

in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.