The new construction of rank codes

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523717

A. Kshevetskiy, E. Gabidulin

引用次数: 126

Abstract

The only known construction of error-correcting codes in rank metric was proposed in 1985. These were codes with fast decoding algorithm. We present a new construction of rank codes, which defines new codes and includes known codes. This is a generalization of E.M. Gabidulin, 1985. Though the new codes seem to be very similar to subcodes of known rank codes, we argue that these are different codes. A fast decoding algorithm is described

查看原文本刊更多论文

等级代码的新构造

唯一已知的秩度量纠错码结构是在1985年提出的。这些是具有快速解码算法的代码。提出了一种新的秩码结构，它定义了新的秩码，并包含了已知的秩码。这是E.M. Gabidulin, 1985年的一个概括。虽然新代码看起来与已知等级代码的子代码非常相似，但我们认为它们是不同的代码。介绍了一种快速解码算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量