Rank error-correcting code
error-correcting code
≈ 5 min read
Rank error-correcting code. encyclopegia.org, snapshot rank-error-correcting-code-503151-373a89b62d754038. /a/rank-error-correcting-code
Names in other languages
- EnglishRank error-correcting codeGabidulin code
- РусскийРанговый код
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In coding theory, rank codes (also called Gabidulin codes) are non-binary[1] 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 − 1) / 2 ⌋, where d is a code distance. As an erasure code, it can correct up to d − 1 known erasures.
A rank code is an algebraic linear code over the finite field GF(qN) similar to Reed–Solomon code.
The rank of the vector over GF(qN) is the maximum number of linearly independent components over GF(q). The rank distance between two vectors over GF(qN) 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.
Rank metric
edit edit sourceLet Xn be an n-dimensional vector space over the finite field GF(qN), where q is a power of a prime and N is a positive integer. Let (u1,u2,…,uN), with ui∈GF(qN), be a base of GF(qN) as a vector space over the field GF(q).
Every element xi∈GF(qN) can be represented as xi=a1iu1+a2iu2+⋯+aNiuN. Hence, every vector x→=(x1,x2,…,xn) over GF(qN) can be written as matrix:
- x→=‖a1,1a1,2…a1,na2,1a2,2…a2,n…………aN,1aN,2…aN,n‖
Rank of the vector x→ over the field GF(qN) is a rank of the corresponding matrix A(x→) over the field GF(q) denoted by r(x→;q).
The set of all vectors x→ is a space Xn=ANn. The map x→→r(x→;q)) defines a norm over Xn and a rank metric:
- d(x→;y→)=r(x→−y→;q)
Rank code
edit edit sourceA set {x1,x2,…,xn} of vectors from Xn is called a code with code distance d=mind(xi,xj). If the set also forms a k-dimensional subspace of Xn, then it is called a linear (n, k)-code with distance d. Such a linear rank metric code always satisfies the Singleton bound d≤n−k+1 with equality.
Generating matrix
edit edit sourceThere are several known constructions of rank codes, which are maximum rank distance (or MRD) codes with d = n − k + 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 [2] (and Kshevetskiy [3] ).
Let's define a Frobenius power [i] of the element x∈GF(qN) as
- x[i]=xqimodN.
Then, every vector g→=(g1,g2,…,gn), gi∈GF(qN), n≤N, linearly independent over GF(q), defines a generating matrix of the MRD (n, k, d = n − k + 1)-code.
- G=‖g1g2…gng1[m]g2[m]…gn[m]g1[2m]g2[2m]…gn[2m]…………g1[(k−1)m]g2[(k−1)m]…gn[(k−1)m]‖,
where gcd(m,N)=1.
Applications
edit edit sourceThere are several proposals for public-key cryptosystems based on rank codes. However, most of them have been proven insecure (see e.g. Journal of Cryptology, April 2008[4]).
Rank codes are also useful for error and erasure correction in network coding.
See also
edit edit sourceNotes
edit edit source- ^ Codes for which each input symbol is from a set of size greater than 2. Wikipedia revision 1320332609, retrieved 2026-11-20
- ^ Gabidulin, Ernst M. (1985). "Theory of codes with maximum rank distance". Problems of Information Transmission. 21 (1): 1–12. Wikipedia revision 1320332609, retrieved 2026-11-20
- ^ Kshevetskiy, Alexander; Gabidulin, Ernst M. (4–9 September 2005). "The new construction of rank codes". Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. pp. 2105–2108. doi:10.1109/ISIT.2005.1523717. ISBN 978-0-7803-9151-2. S2CID 11679865. Wikipedia revision 1320332609, retrieved 2026-11-20
- ^ Overbeck, R. (2008). "Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes". Journal of Cryptology. 21 (2): 280–301. doi:10.1007/s00145-007-9003-9. S2CID 2393853. Wikipedia revision 1320332609, retrieved 2026-11-20
References
edit edit source- Gabidulin, Ernst M. (1985), "Theory of codes with maximum rank distance", Problems of Information Transmission, 21 (1): 1–12
- Kshevetskiy, Alexander; Gabidulin, Ernst M. (4–9 September 2005). "The new construction of rank codes". Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. pp. 2105–2108. doi:10.1109/ISIT.2005.1523717. ISBN 978-0-7803-9151-2. S2CID 11679865.
- Gabidulin, Ernst M.; Pilipchuk, Nina I. (June 29 – July 4, 2003). "A new method of erasure correction by rank codes". IEEE International Symposium on Information Theory, 2003. Proceedings. p. 423. doi:10.1109/ISIT.2003.1228440. ISBN 978-0-7803-7728-8. S2CID 122552232.
External links
edit edit sourceText derived from https://en.wikipedia.org/w/index.php?oldid=1320332609 under CC BY-SA 4.0; modifications have been made.