{
  "id": "rank-error-correcting-code-503151-373a89b62d754038",
  "slug": "rank-error-correcting-code",
  "title": "Rank error-correcting code",
  "qid": "Q4389869",
  "lead": "In coding theory, rank codes (also called Gabidulin codes) are non-binary linear error-correcting codes over not Hamming but rank metric. They described a systematic way of building codes that could detect and correct multiple random rank errors. By adding redundancy with coding k-symbol word to a n-symbol word, a rank code can correct any errors of rank up to t = ⌊ (d &minus; 1) / 2 ⌋, where d is a code distance. As an erasure code, it can correct up to d &minus; 1 known erasures. A rank code is an algebraic linear code over the finite field GF(q^N) similar to Reed–Solomon code. The rank of the vector over GF(q^N) is the maximum number of linearly independent components over GF(q) . The rank distance between two vectors over GF(q^N) is the rank of the difference of these vectors. The rank code corrects all errors with rank of the error vector not greater than t.",
  "body": "In coding theory, rank codes (also called Gabidulin codes) are non-binary linear error-correcting codes over not Hamming but rank metric. They described a systematic way of building codes that could detect and correct multiple random rank errors. By adding redundancy with coding k-symbol word to a n-symbol word, a rank code can correct any errors of rank up to t&nbsp;=&nbsp;⌊&nbsp;(d&nbsp;&minus;&nbsp;1)&nbsp;/&nbsp;2&nbsp;⌋, where d is a code distance. As an erasure code, it can correct up to d &minus; 1 known erasures. A rank code is an algebraic linear code over the finite field GF(q^N) similar to Reed–Solomon code. The rank of the vector over GF(q^N) is the maximum number of linearly independent components over GF(q) . The rank distance between two vectors over GF(q^N) is the rank of the difference of these vectors. The rank code corrects all errors with rank of the error vector not greater than&nbsp;t. Every element x_i \\in GF\\left( {q^N } \\right) can be represented as x_i = a_{1i}u_1 + a_{2i}u_2 + \\dots + a_{Ni}u_N . Hence, every vector \\vec x = \\left( {x_1, x_2, \\dots, x_n } \\right) over GF\\left( {q^N } \\right) can be written as matrix: \\vec x = \\left\\| {\\begin{array}{*{20}c} a_{1,1} & a_{1,2} & \\ldots & a_{1,n} \\\\ a_{2,1} & a_{2,2} & \\ldots & a_{2,n} \\\\ \\ldots & \\ldots & \\ldots & \\ldots \\\\ a_{N,1} & a_{N,2} & \\ldots & a_{N,n} \\end{array}} \\right\\| Rank of the vector \\vec x over the field GF\\left( {q^N} \\right) is a rank of the corresponding matrix A\\left( {\\vec x} \\right) over the field GF\\left( {q} \\right) denoted by r\\left( {\\vec x; q} \\right) . The set of all vectors \\vec x is a space X^n = A_N^n . The map \\vec x \\to r\\left( \\vec x; q \\right) ) defines a norm over X^n and a rank metric: d\\left( {\\vec x;\\vec y} \\right) = r\\left( {\\vec x - \\vec y;q} \\right) ==Rank code== A set \\{x_1, x_2, \\dots, x_n\\} of vectors from X^n is called a code with code distance d = \\min d\\left( x_i ,x_j \\right) . If the set also forms a k-dimensional subspace of X^n , then it is called a linear (n, k)-code with distance d . Such a linear rank metric code always satisfies the Singleton bound d \\leq n - k + 1 with equality. There are several known constructions of rank codes, which are maximum rank distance (or MRD) codes with d&nbsp;=&nbsp;n&nbsp;&minus;&nbsp;k&nbsp;+&nbsp;1. The easiest one to construct is known as the (generalized) Gabidulin code, it was discovered first by Delsarte (who called it a Singleton system) and later by Gabidulin (and Kshevetskiy ). Let's define a Frobenius power [i] of the element x \\in GF(q^N) as x^{[i]} = x^{q^{i \\mod N}}. \\, Then, every vector \\vec g = (g_1, g_2, \\dots, g_n), ~ g_i \\in GF(q^N), ~ n \\leq N , linearly independent over GF(q) , defines a generating matrix of the MRD (n, k, d&nbsp;=&nbsp;n&nbsp;&minus;&nbsp;k&nbsp;+&nbsp;1)-code. G = \\left\\| {\\begin{array}{*{20}c} g_1 & g_2 & \\dots & g_n \\\\ g_1^{[m]} & g_2^{[m]} & \\dots & g_n^{[m]} \\\\ g_1^{[2 m]} & g_2^{[2 m]} & \\dots & g_n^{[2 m]} \\\\ \\dots & \\dots & \\dots & \\dots \\\\ g_1^{[(k-1) m]} & g_2^{[(k-1) m]} & \\dots & g_n^{[(k-1) m]} \\end{array}} \\right\\|, where \\gcd(m,N) = 1 . ==See also== Linear code Reed–Solomon error correction Berlekamp–Massey algorithm Network coding ==Notes== ==References== ==External links== MATLAB implementation of a Rank–metric codec",
  "categories": [
    "20476821",
    "20548265",
    "23603337",
    "26220375"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1320332609",
  "content_hash": "373a89b62d7540385761d62004d5e26747ec7120280d5acfd6d174f0d69f9d06",
  "created_at": 1792311161.8466518,
  "updated_at": 1762218286.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "rank-error-correcting-code-503151-373a89b62d754038",
    "type": "webpage",
    "title": "Rank error-correcting code",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/rank-error-correcting-code",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:rank-error-correcting-code-503151-373a89b62d754038",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1320332609",
    "note": "Immutable snapshot rank-error-correcting-code-503151-373a89b62d754038, content root 373a89b62d754038…"
  }
}