In this paper, we introduce a family of rank codes correcting not only all errors up to the rank ⌊ ( d - 1 ) / 2 ⌋ but also a special kind of errors, so-called ...
If code distance is equal to d, than such codes can correct not only all the errors of rank up to [(d - 1)/2] but also many symmetric errors of rank beyond this ...
Oct 22, 2024 · If code distance is equal to d, than such codes can correct not only all the errors of rank up to ⌊(d-1)/2⌋ but also many symmetric errors of ...
For d = n, we can take an F q -vector space of q n symmetric matrices of size n ×n over F q with the property that every nonzero matrix in this space is ...
On Codes Correcting Symmetric Rank Errors | Semantic Scholar
www.semanticscholar.org › paper › On-...
We study the capability of rank codes to correct so-called symmetric errors beyond the $\left\lfloor \frac{d-1}{2}\right\rfloor$ bound.
Feb 4, 2021 · Abstract—This paper investigates the decoding of certain. Gabidulin codes that were transmitted over a channel with space-symmetric errors.
We study the capability of rank codes to correct so-called symmetric errors beyond the $\left\lfloor \frac{d-1}{2}\right\rfloor$ bound. If...
[89] E. M. Gabidulin and N. I. Pilipchuk, “Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound,” Dis- crete Applied Mathematics ...
A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes · Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound · Space-time ...
Jul 12, 2021 · This paper investigates the decoding of certain Gabidulin codes over a channel with space-symmetric errors. Space-symmetric errors are ...