On fast decoding of interleaved Gabidulin codes

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2012-10-25 DOI:10.1109/RED.2012.6338413

V. Sidorenko, A. Wachter-Zeh, Di Chen

引用次数: 7

Abstract

Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.

查看原文本刊更多论文

交错加比度林码的快速译码

随机网络编码可以采用秩距为d的L个Gabidulin码的交错或直接和。对于Fqm上的码，提出了一种快速译码算法，对秩高概率误差进行纠错，纠错概率最高可达L / L+1(d-1)。该算法基于快速斜反馈移位寄存器合成，对于固定L，基域Fq的运算时间复杂度为0 (m3logm)。

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

求助全文

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

来源期刊

2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems

自引率

0.00%

发文量