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

对所有长度n <= q的最优LRC码

Optimal LRC codes for all lenghts n <= q

Oleg Kolosov, Alexander Barg, Itzhak Tamo, Gala Yadgar

摘要:

本文从$q$元Reed-Solomon码的某些子码出发,提出了一类距离最优LRC码。Tamo和A.~ Barg在2014年假设码长$n$是$r+1.$的倍数通过缩短这个族的码,我们证明了可以解除这个假设,仍然获得距离最优码。

英文摘要:

A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes.

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

↑