Related papers: Counting The Generator Matrices of $\mathbb{Z}_{2}…
This paper is devoted to the explicit computation of generating series for the connection coefficients of two commutative subalgebras of the group algebra of the symmetric group, the class algebra and the double coset algebra. As shown by…
In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
We define matrix models that converge to the generating functions of a wide variety of loop models with fugacity taken in sets with an accumulation point. The latter can also be seen as moments of a non-commutative law on a subfactor planar…
Matrix generators for the general and special linear groups, the symplectic groups and the general and special unitary groups over finite fields. For the most part the generators have been obtained by translating Steinberg's generators for…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
There has been much research on codes over $\mathbb{Z}_4$, sometimes called quaternary codes, for over a decade. Yet, no database is available for best known quaternary codes. This work introduces a new database for quaternary codes. It…
The $\Z_{p^s}$-additive codes of length $n$ are subgroups of $\Z_{p^s}^n$, and can be seen as a generalization of linear codes over $\Z_2$, $\Z_4$, or $\Z_{2^s}$ in general. A $\Z_{p^s}$-linear generalized Hadamard (GH) code is a GH code…
We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
Let $\mathcal{R}_e=GR(p^e,r)[y]/\langle g(y),p^{e-1}y^t\rangle$ be a finite commutative chain ring, where $p$ is a prime number, $GR(p^e,r)$ is the Galois ring of characteristic $p^e$ and rank $r,$ $t$ and $k$ are positive integers…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
We introduce a hybridization of digital sequences with uniformly distributed sequences in the domain of $b$-adic integers, $\mathbb Z_{b}, b\in\mathbb N\setminus\{1\}$, by using such sequences as input for generating matrices. The…
Given a graph with edges labeled by elements in $\mathbb{Z}/m\mathbb{Z}$, a generalized spline is a labeling of each vertex by an integer $\mod m$ such that the labels of adjacent vertices agree modulo the label associated to the edge…