Related papers: Counting The Generator Matrices of $\mathbb{Z}_{2}…
Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…
The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a…
In this paper, we investigate certain combinatorial numbers, the \textit{moment generating Stirling numbers}. They are a special case of Hsu's generalized Stirling numbers and satisfy many more properties and combinatorial identities than…
In this paper, we derive a formula for constructing a generator matrix for the intersection of any pair of linear codes over a finite field. Consequently, we establish a condition under which a linear code has a trivial intersection with…
We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…
Partially ordered sets have received much attention in recent years, not just due to their usefulness in combinatorics and abstract algebra, but also due to their practical applications in fields ranging from chemistry to macroeconomics.…
Double Hurwitz numbers have at least four equivalent definitions. Most naturally, they count covers of the Riemann sphere by genus g curves with certain specified ramification data. This is classically equivalent to counting certain…
Given a matrix $A\in \mathrm{GL}_d(\mathbb{Z})$. We study the pseudorandomness of vectors $\mathbf{u}_n$ generated by a linear recurrent relation of the form $$ \mathbf{u}_{n+1} \equiv A \mathbf{u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots, $$…
In this paper, we study codes with sparse generator matrices. More specifically, low-density generator matrix (LDGM) codes with a certain constraint on the weight of the columns in the generator matrix are considered. In this paper, it is…
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
This paper is devoted to the theory of $GL_n({\mathbb Z})$-conjugacy classes of regular integer $n\times n$ matrices. Such a matrix is $GL_n({\mathbb Q})$-conjugate to the companion matrix of its characteristic polynomial. But the set of…
Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where breaking just the symmetries in a generating set is complete,…
We prove that for any positive integers $n$ and $k$ such that $n\!\geq\! k\!\geq\! 1$, there exists an $[n,k]$ generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size…
In order to alleviate data sparsity and overfitting problems in maximum likelihood estimation (MLE) for sequence prediction tasks, we propose the Generative Bridging Network (GBN), in which a novel bridge module is introduced to assist the…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We postulate that this study can be viewed as a linear algebraic analogue of the classical topic of enumerating…
Learning representations of molecular structures using deep learning is a fundamental problem in molecular property prediction tasks. Molecules inherently exist in the real world as three-dimensional structures; furthermore, they are not…
We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…