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 be the finite field with elements of characteristic , be a power of , and be a positive integer. Let and be the Frobenius -automorphism of , set . Based on the multiplicative property of the kernel filtration of the nilpotent map , we construct optimal Ferrers diagram rank-metric codes for block monotone diagrams. Specifically, considering Ferrers diagrams, we prove that optimal codes always exist for block monotone diagrams when . Furthermore, by employing puncturing on columns, we prove that optimal codes also always exist for block strictly monotone diagrams, removing the restriction . 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.