arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0601090cs.ITmath.IT
收藏

改进的准MDS扩展码

Improved Nearly-MDS Expander Codes

Ron M. Roth, Vitaly Skachek

摘要:

提出了一种具有以下三个性质的扩展码的构造:(i)码接近Singleton界,(ii)它们可以以码长为线性的时间复杂度进行编码,(iii)它们具有线性时间有界距离解码器。通过使用一个版本的解码器,纠正也擦除,代码可以取代MDS外码级联结构,从而导致线性时间可编码和可解码的代码,接近Zyablov界或无记忆信道的容量。所提出的构造改进了Guruswami和Indyk的早期结果,即任何低于Singleton界的速率和相对最小距离对于显著较小的字母大小都是可以实现的。

英文摘要:

A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace MDS outer codes in concatenated constructions, thus resulting in linear-time encodable and decodable codes that approach the Zyablov bound or the capacity of memoryless channels. The presented construction improves on an earlier result by Guruswami and Indyk in that any rate and relative minimum distance that lies below the Singleton bound is attainable for a significantly smaller alphabet size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑