Jun 18, 2024 · A subspace of \mathrm{Sym}_q(m) equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering ...

Mar 12, 2023 · In this paper, we generalize the construction of symmetric Gabidulin codes to polynomials of degree d>2 over field of characteristic 0 or >d.

These codes are called symmetric rank codes. In the vector representation, such codes are maximum rank distance (MRD) linear [n, 1, n] codes, which allows one ...

Oct 22, 2024 · These codes are called symmetric rank codes. In the vector representation, such codes are maximum rank distance (MRD) linear [n, 1, n] codes, ...

These codes are called symmetric rank codes. In the vector represen- tation, such codes are maximum rank distance (MRD) linear [n, 1,n] codes, which allows one.

Nov 25, 2024 · Abstract. Over fields of characteristic unequal to 2, we can identify symmetric matrices with homogeneous polynomials of degree 2.

Rank codes can correct rather complicated errors. For instance, if a linear rank code has rank distance d , then it corrects any matrix error provided that the ...

The super-symmetric rank codes are rank-metric codes over binary fields with lengths N s = 2 s , s = 0, 1, …, where codes of length N s are designed ...

Mar 13, 2023 · A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering ...

These codes are called symmetric rank codes. In the vector representation, such codes are maximum rank distance (MRD) linear [ n , 1, n ] codes.