Related papers: New Constructions of Permutation Arrays
In this paper we define a chain of $n$-dimensional evolution algebras corresponding to a permutation of $n$ numbers. We show that a chain of evolution algebras (CEA) corresponding to a permutation is trivial (consisting only algebras with…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…
Let $N(d,d^\perp)$ denote the minimum length $n$ of a linear code $C$ with $d$ and $d^{\bot}$, where $d$ is the minimum Hamming distance of $C$ and $d^{\bot}$ is the minimum Hamming distance of $C^{\bot}$. In this paper, we show a lower…
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…
In this work, we study probing for the more general problem of computing the trace of a permutation of $A^{-1}$, say $PA^{-1}$. The motivation comes from Lattice QCD where we need to construct "disconnected diagrams" to extract…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
We show that for every $n \in \mathbb N$ there is a collection of points $p_1, \ldots, p_n$ and lines $\ell_1, \ldots, \ell_n$ in the unit square such that for any $i$ we have $p_i \in \ell_i$ and the distance from $p_i$ to any other line…
A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ permutations. For $v…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
A polynomial ensemble is a probability density function for the position of $n$ real particles of the form $\frac{1}{Z_n} \, \prod_{j<k} (x_k-x_j) \, \det \left[ f_k (x_j) \right]_{j,k=1}^n$, for certain functions $f_1, \ldots, f_n$. Such…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…
We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other…
We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…
We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…
Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…