a r t i c l e i n f o a b s t r a c t Keywords: Algorithms Combinatorial problems Pattern avoiding permutation Whole duplication-random loss model Genome Generating algorithm Binary reflected Gray code In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model af...

This paper proposes a novel method for watermarking C source code by exploiting the programming language features.The key idea of our watermarking scheme is a semantics-preserving program transformation, based on a hidden permutation of local identifiers, followed by another hidden permutation of the functions defined in the source code. This last permutation allows to encrypt the prove of owne...

We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity for a fixed permutation of the code. We examine constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code. We identify the primitive structures that can appear in a minimal trellis and relate this to those for the ...

In this paper, novel selective encryption image schemes based on JPEG2000 are proposed. The first one encrypts only the code-blocks corresponding to some sensitive precincts. In order to improve the security level we introduce the permutation of codeblocks contributing in the selected precincts. The idea of combining permutation and selective encryption is used in order to minimize the amount o...

Permutation source codes are a class of structured vector quantizers with a computationally-simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate–distortion performance. In the first approach, the new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods fo...

In this paper, we study a relative two-weight Z2Z4-additive codes. It is shown that the Gray image of a two-distance Z2Z4-additive code is a binary two-distance code and that the Gray image of a relative two-weight Z2Z4-additive code, with nontrivial binary part, is a linear binary relative two-weight code. The structure of relative two-weight Z2Z4-additive codes are described. Finally, we disc...

In this paper, a turbo receiver for MIMO-CDMA systems employing parity bit selected and permutation spreading is proposed. In such systems, spreading codes used by transmit antennas are dependent on the transmitted data. In the proposed system, convolutional coding is used as an outer code, while the parity bit selected scheme is used as the inner code. Detection and decoding are performed iter...

Python implementation of permutations is presented. Three classes are introduced: Perm for permutations, Group for permutation groups, and PermError to report any errors for both classes. The class Perm is based on Python dictionaries and utilize cycle notation. The methods of calculation for the perm order, parity, ranking and unranking are given. A random permutation generation is also shown....

Some numerical characteristics of bipartite graphs in relation to the problem of finding all disjoint pairs of S-permutation matrices in the general n × n case are discussed in this paper. All bipartite graphs of the type g = 〈Rg ∪ Cg, Eg〉, where |Rg| = |Cg | = 2 or |Rg| = |Cg | = 3 are provided. The cardinality of the sets of mutually disjoint S-permutation matrices in both the 4× 4 and 9× 9 c...

A permutation array (or code) of length n and distance d is a set G of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x; y [G is at least d. One motivation for coding with permutations is powerline communication. After summarizing known results, it is shown here that certain families of polynomials over finite fields give rise to permutation a...