betaFeedback

WorksComputer Science

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

Abstract

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 Fq\mathbb{F}_q be the finite field with qq elements of characteristic pp, PP be a power of pp, and ee be a positive integer. Let L=FqePL=\mathbb F_{q^{eP}} and σσ be the Frobenius Fq\mathbb F_q-automorphism of LL, set N=σe−idN=σ^e-\mathrm{id}. Based on the multiplicative property of the kernel filtration of the nilpotent map NN, we construct optimal Ferrers diagram rank-metric codes for block monotone diagrams. Specifically, considering n×ln \times l Ferrers diagrams, we prove that optimal codes always exist for block monotone diagrams when n=ePn = eP. Furthermore, by employing puncturing on columns, we prove that optimal codes also always exist for block strictly monotone diagrams, removing the restriction n=ePn = 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.

Paper details

vlnc:W_7wezmdgm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…