Related papers: Quasi-recursive MDS Matrices over Galois Rings
Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…
Designing good error correcting codes whose generator matrix has a support constraint, i.e., one for which only certain entries of the generator matrix are allowed to be non-zero, has found many recent applications, including in distributed…
Maximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper,…
Consider the moduli space, $\mathcal{M}_{d}$, of degree $d \geq 2$ polynomials over $\mathbb{C}$, with a marked critical point. Given $k \geq 0,\; p$ an odd prime, we show that the set $\Sigma_{k,1,p}$ of conjugacy classes of degree $p$…
A problem of current interest, also motivated by applications to Coding theory, is to find explicit equations for \textit{maximal} curves, that are projective, geometrically irreducible, non-singular curves defined over a finite field…
In AES-like ciphers, diffusion layers are commonly instantiated using MDS matrices, since their optimal branch number yields strong diffusion guarantees and underpins classical resistance arguments against differential and linear…
Let $D$ be a domain with fraction field $K$, and let $M_n(D)$ be the ring of $n \times n$ matrices with entries in $D$. The ring of integer-valued polynomials on the matrix ring $M_n(D)$, denoted ${\rm Int}_K(M_n(D))$, consists of those…
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, $$…
A transition matrix $[U_{i,j}]_{i,j\geq 0}$ on $\mathbb{N}$ is said to be almost upper triangular if $U_{i,j}\geq 0\Rightarrow j\geq i-1$, so that the increments of the corresponding Markov chains are at least $-1$; a transition matrix…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can…
We propose an approach for the computation of multi-parameter families of Galois extensions with prescribed ramification type. More precisely, we combine existing deformation and interpolation techniques with recently developed strong tools…
This paper studies the multiplicative ideal structure of commutative rings in which every finitely generated ideal is quasi-projective. Section 2 provides some preliminaries on quasi-projective modules over commutative rings. Section 3…
For a prime $p$, let $F_q$ be the finite field of order $q= p^d$. This paper presents the study on skew generalized quasi-cyclic (SGQC) codes of length $n$ over the non-chain ring $F_q+vF_q$ where $v^2=v$ and $\theta_t$ is the Galois…
Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental…
Trefftz schemes are high-order Galerkin methods whose discrete spaces are made of elementwise exact solutions of the underlying PDE. Trefftz basis functions can be easily computed for many PDEs that are linear, homogeneous, and have…
A natural generating set for a Galois extension regarded as the splitting field of an irreducible polynomial is introduced and investigated here. Minimal generating sets arising in this context throw many surprises compared to the analogous…
We define the notion of $(p_0,p_1,\dots,p_d)$-type semi-equivelar gems for closed connected PL $d$-manifolds, related to the regular embedding of gems $\Gamma$ representing $M$ on a surface $S$ such that the face-cycles at all the vertices…