Stopping Sets of Hermitian Codes.

IEEE Trans. Information Theory（2016）

引用 1|浏览22

暂无评分

摘要

Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.

查看译文

关键词

Iterative decoding,Linear codes,Reed-Solomon codes,Sparse matrices,Electronic mail

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要