Related papers: Combinatorial Gray codes for classes of pattern av…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provide two generalizations of this result. Firstly, we describe…
We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform.…
In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…
We investigate coding schemes that map source symbols into multisets of an alphabet set. Such a formulation of source coding is an alternative approach to the traditional framework and is inspired by an object tracking problem over…
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
Partially ordered patterns (POPs) play an important role in the study of permutation patterns, providing a convenient framework for describing large families of classical patterns. The problem of enumerating permutations that avoid POPs has…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…
We construct Gray codes over permutations for the rank-modulation scheme, which are also capable of correcting errors under the infinity-metric. These errors model limited-magnitude or spike errors, for which only single-error-detecting…
Let $\mathcal{C}_n$ denote the set of words $w=w_1\cdots w_n$ on the alphabet of positive integers satisfying $w_{i+1}\leq w_i+1$ for $1 \leq i \leq n-1$ with $w_1=1$. The members of $\mathcal{C}_n$ are known as Catalan words and are…