Searcharxiv⌕ Search

arXiv subjects

Dengming Xu

Publications and source records attributed to Dengming Xu.

6 recordsLinked to original sources

New constructions of optimal Ferrers diagram rank-metric codes for quasi-block monotone Ferrers diagrams

Constant dimension subspace codes (CDCs) have become an important object in coding theory due to their applications in random network coding. The paper is devoted to constructing optimal Ferrers diagram rank-metric codes for block Ferrers diagrams, which play a crucial role in the multilevel construction of CDCs. Let \(\mathbb{F}_q\) be the finite field with \(q\) elements of characteristic \(p\), \(P\) be a power of \(p\), and \(e\) be a positive integer. Let \(L=\mathbb F_{q^{eP}}\) and \(σ\) be the Frobenius \(\mathbb F_q\)-automorphism of \(L\), set \(N=σ^e-\mathrm{id}\). Based on the multiplicative property of the kernel filtration of the nilpotent map \(N\), we construct optimal Ferrers diagram rank-metric codes for block monotone diagrams. Specifically, considering \(n \times l\) Ferrers diagrams, we prove that optimal codes always exist for block monotone diagrams when \(n = eP\). Furthermore, by employing puncturing on columns, we prove that optimal codes also always exist for block strictly monotone diagrams, removing the restriction \(n = eP\). Consequently, optimal codes always exist for block upper triangular diagrams, specifically for maximum sum-rank distance (MSRD)-constructible block diagram pairs, which generalizes the corresponding results in \cite{neri2024,calderini2026}, in which the rank distance or the characteristic is restricted. Furthermore, by employing both puncturing and shortening on columns, we prove that optimal codes always exist for quasi-block strictly monotone diagrams, thereby generalizing the corresponding results in \cite{pratihar2023, zhang2019}. The optimal codes constructed in this paper will potentially be beneficial to the further construction of CDCs.

cs.IT↗

Puncturing-inclusion constructions of optimal Ferrers diagram rank-metric codes using semifield codes

Ferrers diagram rank-metric codes are essential components of the multilevel construction of constant dimension codes for random network coding. This paper aims to construct optimal Ferrers diagram rank-metric codes, focusing on the diagram \([3,3,3,5]\) with rank distance \(3\). We construct an optimal \([[3,3,3,5],6,3]_q\) Ferrers diagram rank-metric code for every prime power \(q\), thereby answering an open problem posed by Etzion et al. in 2016~\cite{Etzion2016}. The construction first builds a \([3\times4,4,3]_q\) MRD code and then proves that the Delsarte dual of its puncturing on the last column contains a \([3\times3,3,3]_q\) MRD code, which comes from semifield codes. We further construct optimal Ferrers diagram rank-metric codes for two infinite families of Ferrers diagrams: the first relies on the \([[3,3,3,5],6,3]_q\) construction and holds for every prime power \(q\), while the second is binary and obtained directly by the puncturing-inclusion construction.

cs.IT↗

Multilevel constructions of constant dimension codes based on one-factorization of complete graphs

Constant dimension codes (CDCs) have become an important object in coding theory due to their application in random network coding. The multilevel construction is one of the most effective ways to construct constant dimension codes. The paper is devoted to constructing CDCs by the multilevel construction. Precisely, we first choose an appropriate skeleton code based on the transformations of binary vectors related to the one-factorization of complete graphs; then we construct CDCs by using the chosen skeleton code, where quasi-pending blocks are used; finally, we calculate the dimensions by use of known constructions of optimal Ferrers diagram rank metric codes. As applications, we improve the lower bounds of $\overline{A}_q(n,8,6)$ for $16\leq n\leq 19.$

cs.IT↗

On the Jacobi sums over Galois rings

In this paper, we study the Jacobi sums over Galois rings of arbitrary characteristics and completely determine their absolute values, which extends the work in \cite{feng1}, where the Jacobi sums over Galois rings with characteristics a square of a prime number were discussed.

cs.IT↗

Construction of mutually unbiased maximally entangled bases in $\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings

Mutually unbiased bases plays a central role in quantum mechanics and quantum information processing. As an important class of mutually unbiased bases, mutually unbiased maximally entangled bases (MUMEBs) in bipartite systems have attracted much attention in recent years. In the paper, we try to construct MUMEBs in $\mathbb{C}^{2^s} \otimes \mathbb{C}^{2^s}$ by using Galois rings, which is different from the work in \cite{xu2}, where finite fields are used. As applications, we obtain several new types of MUMEBs in $\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ and prove that $M(2^s,2^s)\geq 3(2^s-1)$, which raises the lower bound of $M(2^s,2^s)$ given in \cite{xu}.

cs.IT↗

Homological dimensions and strongly idempotent ideals

Let A be an Artin algebra and e an idempotent in A. It is an interesting topic to compare the homological dimension of the algebras A,A/AeA and eAe. For example, in [2], the relation among the global dimension of these algebras is discussed under the condition that AeA is a strongly idempotent ideal. Motivated by this, we try to compare the finitistic dimension of these algebras under certain homological conditions on AeA. In particular, under the condition that AeA is a strongly idempotent ideal with finite projective dimension, we prove that if the finitistic projective (or injective) dimension of eAe and A/AeA are finite, then the finitistic projective (or injective) dimension of A is finite. This is a generalized version of the main result in [1].

math.RT↗