An Efficient Reed-Solomon Erasure Code over Cantor-constructed Binary Extension Finite Fields

ISIT(2023)

引用 0|浏览9
暂无评分
摘要
In this paper, we investigate the properties of the novel polynomial basis proposed by Lin, Chung, and Han over Cantor-constructed binary extension finite fields and propose an improved truncated LCH transform for discrete intervals. Incorporating these results leads us to the development of efficient encoding/decoding algorithms of (n,k) Reed-Solomon erasure codes with time complexity O(nlog(T)) and O (1) space complexity, where T < n. We also propose its performance-tuned variation of the decoding algorithm when only recovery of message symbols is concerned. Our experiment in the production environment indicates a performance gain of ×1 on average and ×2 at most towards the original decoder algorithm.
更多
查看译文
关键词
Cantor-constructed binary extension finite fields,discrete interval,encoding-decoding algorithm,polynomial basis,Reed-Solomon erasure code,space complexity,time complexity,truncated LCH transform
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要