Low-Complexity Kötter’s Interpolation for List Decoding of Elliptic Codes

IEEE Communications Letters（2021）

引用 0|浏览6

暂无评分

摘要

This letter proposes the low-complexity Kötter’s interpolation algorithm for list decoding of elliptic codes. Given a multiplicity matrix $\mathbf {M}$ , the decoding output list size $l$ is first determined and the corresponding interpolation module 更多

查看译文

关键词

Interpolation,Codes,Decoding,Complexity theory,Upper bound,Iterative decoding,Elliptic curves

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要