Maximum weight codewords of a linear rank metric code

MaRDI QIDQ6425197zbMATH OpenFDO

Authors Olga Polverino, Paolo Santonastaso, Ferdinando Zullo

Publication date 2 February 2023

Abstract: Let $mathcalCsubseteqmathbb{F}_{q^m}^n$ be an $mathbb{F}_{q^m}$-linear non-degenerate rank metric code with dimension $k$. In this paper we investigate the problem of determining the number $M(mathcalC)$ of codewords in $mathcalC$ with maximum weight, that is $minm,n$, and to characterize those with the maximum and the minimum values of $M(mathcalC)$.

This page was built for publication: Maximum weight codewords of a linear rank metric code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425197)