Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter is a lower dimens...

A permutation array(permutation code, PA) of length n and distance d, denoted by (n, d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y ∈ C is at least d. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of (n, d) PA from permutation group with...

In this paper a new interleaver is investigated, namely the permutation polynomial P(x) = (a0x + a1) + a2 over a prime field Fp, and it is shown that it has some favourable properties. The exact value of dispersion of P(x) is given in terms of the parameters a0, a1. Results on the construction and enumeration of permutations P(x) with prescribed dispersion (e.g. close to that of a random interl...

AbstractCombinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design by evolutionary algorithms (EA) developing iterative approach. Starting from a single random permutation, new permutations satisfying minimum d...

In frequency selective channel, some frequencies may be in deep fade. Inherent frequency diversity in multilevel frequency shift keying is exploited by a coding technique called permutation code, which ensures that the frequencies occur equally often. Information bits are uniformly spread over the frequency band. The performance of permutation codes and 4FSK in terms of bit error rate is compar...

Distributed models of lexical semantics increasingly incorporate information about word order. One influential method for encoding this information into high-dimensional spaces uses convolution to bind together vectors to form representations of numerous n-grams that a target word is a part of. The computational complexity of this method has led to the development of an alternative that uses ra...

The purpose of this paper is to study the Parker vectors (in fact, sequences) of several known classes of oligomorphic groups. The Parker sequence of a group G is the sequence that counts the number of G-orbits on cycles appearing in elements of G. This work was inspired by Cameron’s paper on the sequences realized by counting orbits on k-sets and k-tuples.

An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...

and a positive integer m. The resulted array has ( |PA(p, k)| · p(m−1)(p−k) )m rows. Compared to the other constructions, the new construction gives a permutation array of far bigger size with a large minimum distance, for example, when k ≥ 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA ( pm, pm−1k ) for a given index i very simply. key words: permutat...