.png){kind=icon}
返回
An Efficient (n, k) Information Dispersal Algorithm Based on Fermat Number Transforms
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2013.2270892.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The (n, k) information dispersal algorithm (IDA) is a coding technique converting a digital source file into n small digital files (shadows), and the receipt of any k out of the n shadows can losslessly reconstruct the source file. This paper presents an encoding and two decoding algorithms of (n, k) IDA via the fast Fermat number transform (FNT). The proposed encoding algorithm requires O(n log k) arithmetic operations, and the two decoding algorithms have complexities O(n log k) and O(k log(2) k) for a reasonably large file. As compared with existing work, the proposed algorithms generate significant improvement in the throughput in the low code rate k/n <= 1/2 settings.
Keyword:
Erasure codes
fast Fourier transforms
Galois fields
information dispersal algorithm (IDA)
Reed-Solomon codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
Petrogenesis of orbicular ijolites from the Prairie Lake complex, Marathon, Ontario: Textural evidence from rare processes of carbonatitic magmatism.png)
Lithos
LithosIF0
PREAI
分享收藏分享收藏
查看更多内容