×
We study the capability of rank codes to correct so-called symmetric errors beyond the \left\lfloor \frac{d-1}{2}\right\rfloor bound.
In particular, one can choose codes correcting symmetric errors up to rank d − 1, i.e., the error capacity for symmetric errors is about twice the error ...
We study the capability of rank codes to correct so-called symmetric errors beyond the $\left\lfloor \frac{d-1}{2}\right\rfloor$ bound.
Oct 22, 2024 · In particular, one can choose codes correcting symmetric errors up to rank d–1, i.e., the error capacity for symmetric errors is about twice ...
We study the capability of rank codes to correct so-called symmetric errors beyond the $\left\lfloor \frac{d-1}{2}\right\rfloor$ bound.
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 ...
Jun 18, 2024 · In this paper we study the covering properties of symmetric rank-metric codes. First we characterize symmetric rank-metric codes which are ...
People also ask
Oct 22, 2024 · We investigate matrix codes containing a linear subcode of symmetric matrices. The corresponding vector codes contain a linear subspace of so- ...
Dec 16, 2022 · Abstract:We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results.
Rank codes can be described either as matrix codes over the base field F"q or as vector codes over the extension field F"q"^"n. For any matrix code, ...