Rank error-correcting code
id:
rank-error-correcting-code-292-14367839
title:
Rank error-correcting code
text:
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 algebra
brand slug:
wiki
category slug:
encyclopedia
description:
Error-correcting code
original url:
https://en.wikipedia.org/wiki/Rank_error-correcting_code
date created:
date modified:
2023-08-12T19:03:41Z
main entity:
{"identifier":"Q4389869","url":"https://www.wikidata.org/entity/Q4389869"}
image:
fields total:
13
integrity:
14