Permutation codes, introduced by Slepian, were shown to perform well on an additive white Gaussian noise (AWGN) channel. Unfortunately, these codes required large lookup tables, making them quite complex to implement even though the maximum-likelihood decoder is very simple. In this correspondence, we present an enumeration scheme which encodes and decodes permutation codes with low complexity....

In this work we present and analyze a conceptually novel encryption method for digital videos. This type of encryption has several advantages over currently available video encryption algorithms. We analyze both security and performance aspects of our method, and show that the method is efficient and secure from a cryptographic point of view. Even though the approach is currently feasible only ...

Let C be a conjugation class of permutations of a finite field Fq. We consider the function NCðqÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q 2. In 1969, Wells proved a formula for N1⁄23 ðqÞ where 1⁄2k denotes the conjugation class of k-cycles. We will prove formulas for N1⁄2k ðqÞ where k 1⁄4 4; 5; 6 and for the classes of permutation...

BACKGROUND Cardiovascular diseases are the leading cause of death worldwide. A prominent cause of cardiovascular events is atherosclerosis, a chronic inflammation of the arterial wall that leads to the formation of so called atherosclerotic plaques. There is a strong clinical need to develop new, non-invasive vascular imaging techniques in order to identify high-risk plaques, which might escape...

We show how to onstru t pseudo-random permutations that satisfy a ertain y le restri tion, for example that the permutation be y li ( onsisting of one y le ontaining all the elements) or an involution (a self-inverse permutation) with no xed points. The onstru tion an be based on any (unrestri ted) pseudo-random permutation. The resulting permutations are de ned su in tly and their evaluation a...

Cayley graphs and elementary group theory are used to eeciently nd minimum length permutation routes in a bus interconnection network. Cayley graphs have been used extensively to design interconnection networks and provide a natural setting for studying point-to-point routing 1, 2, 3, 4], but the technique has not been widely used for the more important problem of permutation routing. This is d...

Blind source separation (BSS) and sound activity detection (SAD) from a sound source mixture with minimum prior information are two major requirements for computational auditory scene analysis that recognizes auditory events in many environments. In daily environments, BSS suffers from many problems such as reverberation, a permutation problem in frequency-domain processing, and uncertainty abo...

in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

We explore some novel connections between the main privacy models in use and we recall a few known ones. We show these models to be more related than commonly understood, around two main principles: deniability and permutation. In particular, randomized response turns out to be very modern in spite of it having been introduced over 50 years ago: it is a local anonymization method and it allows ...