Rank error-correcting code
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 − 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 similar to Reed–Solomon code.
hierarchy
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Rank error-correcting code
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 − 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 similar to Reed–Solomon code.
has abstract
In coding theory, rank codes ( ...... ror vector not greater than t.
@en
Ранговый код — алгебраический ...... ранг ошибки не выше заданного.
@ru
Link from a Wikipage to an external page
Wikipage page ID
35,083,145
page length (characters) of wiki page
Wikipage revision ID
943,078,786
Link from a Wikipage to another Wikipage
alphabet size
Q = qN
@en
block length
n
@en
decoding
distance
n − k + 1
@en
hierarchy
label
Rank error-correcting code
@en
Ранговый код
@ru
message length
k
@en
name
Rank codes
@en
notation
[n, k, d]-code
@en
wikiPageUsesTemplate
comment
In coding theory, rank codes ( ...... similar to Reed–Solomon code.
@en
Ранговый код — алгебраический ...... ранг ошибки не выше заданного.
@ru