Talk:Rank error-correcting code
 | This article has not yet been rated on Wikipedia's content assessment scale. |
Arpitdm (talk) 08:43, 24 August 2016 (UTC) The current page on Rank Error-Correcting Code is incorrect in a number of places and imprecise in others. The following are some points to begin with: 1. The Introduction: - Rank error codes are not also called Gabidulin Codes. Rank Metric Codes are a separate class of codes over the rank metric. Gabidulin Codes are an example of Rank Metric Codes. Gabidulin Codes are linear (actually non-linear Gabidulin Codes makes no sense at all) and they are the most popular/well-known rank metric codes. There exist linear as well as non-linear Rank Metric Codes. And so the first line ("In coding theory, rank codes (also called Gabidulin codes) are non-binary[1] linear error-correcting codes over not Hamming but rank metric.") itself is incorrect[1].
- Rank metric codes are not analogous to Reed Solomon Codes. Gabidulin Codes are the equivalent of Generalized Reed Solomon Codes (which are based in the Hamming metric) in the rank metric.
- A direct formula is given for the number of errors that a rank metric code can correct. There should be a citation for this. I am not sure that the formula is true for every type of rank metric code.
I propose that a new design for this entire page needs to be worked out. And there should be a different page for Gabidulin Codes which can be referenced by this page. Arpitdm (talk) 08:43, 24 August 2016 (UTC)