Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless algorithm [Inform. Process. Lett. 70 (1999) 7] to generate Gray codes for k-ary trees. In this paper, another loopless algorithm is presented to list Gray codes for k-ary trees more efficiently in both space and time th...

In this paper we present an optimal algorithm for scheduling complete k-ary tree on two uniform processors of di erent speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k ≥ 2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

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

In this paper, it is proposed a new soft decoding algorithm of the the q-ary image of some q-ary Reed-Solomon Codes. This algorithm uses some permutations to improve the performances of an usual soft decision decoding.

Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topolo...

The comparison of symbol error probability(SEP) for different M-ary modulation techniques over slow, flat, identically independently distributed Rician fading channel is presented in this paper. Because fading is one of the major limitations in wireless communication, so modulation technique with diversity is used to transmit message signal efficiently. Exact analysis of symbol error probabilit...

Binary low-density parity-check (LDPC) codes perform very well on magnetic recording channels (MRCs) with additive white Gaussian noise (AWGN). However, an MRC is subject to other impairments, such as media defects and thermal asperities. Binary LDPC codes may not be able to cope with these impairments without the help of a Reed–Solomon code. A better form of coding may be -ary LDPC codes, whic...

Using double counting, we prove Delsarte inequalities for qary codes and their improvements. Applying the same technique to q-ary constant-weight codes, we obtain new inequalities for q-ary constantweight codes.

Within the scope of this investigation, MATLAB simulation code for digital video broadcasting–for satellite–second generation (DVB-S2) has been constructed. Forward error correction (FEC) rates as 3/5, 2/3, and 3/4 across additive white Gaussian noise (AWGN) Rayleigh fading channels are used to evaluate system's performance, mainly while working on quadrature phase-shift keying (QPSK), 8-ary (8...