Non-minimum tensor rank Gabidulin codes

Finite fields (field-theoretic aspects) (12E20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05)

Abstract: The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an

8

-dimensional

m a t h b b F_{q}

-linear generalized Gabidulin code in

m a t h b b F_{q}^{4 i m e s 4}

. This shows that such a code is never minimum tensor rank. In this way, we detect the first infinite family of Gabidulin codes which are not minimum tensor rank.

Review text

Generalized Gabidulin codes \(C\) are a special class of rank-metric codes, i.e. codes that are associated to a slice space \(L=L(T_C)\) of a 3-tensor \(T_C\) over a finite field \(\mathbb F_q\). Among rank-metric codes, the Gabidulin codes are associated to \(\mathbb F_{q^n}\)-subspaces generated by \(x,x^{q^s},\dots,x^{q^{s(k-1)}}\), for integers \(k,s\) with \(1\leq k\leq n\) and \(gcd(s,n)=1\), and for \(x\in \mathbb F_q^k\times\mathbb F_q^k\). The determination of the tensor rank of rank-metric codes \(C\) is important as it provides a measure of efficiency: codes with associated tensors of small rank provide a more efficient encoding. As a consequence of some uniqueness criteria on tensor decomposition, there is a lower bound for the rank of rank-metric codes. The authors provide a computation for the rank of tensors associated to some Gabidulin codes. In particular, they prove that the rank of a generalized Gabidulin code of dimension \(8\) over \(\mathbb F_q^4\times\mathbb F_q^4\) is \(12\) for \(q=2\), and it is \(11\) if \(q>2\). Then, it turns out that these generalized Gabidulin codes are not rank-metric codes of minimal rank.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Non-minimum tensor rank Gabidulin codes

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