An Algorithm for Counting the Number of 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity.

IACR Cryptology ePrint Archive(2016)

引用 23|浏览9
暂无评分
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要