Minimal polynomial algorithms for finite sequences
IEEE Transactions on Information Theory（2010）
摘要
In this paper, we show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of an algorithm in a recent paper of A. Salagean.
更多查看译文
关键词
simpler version,minimal polynomial.,recent paper,finite sequence,berlekamp-massey algorithm,characteristic polynomial,minimal polynomial algorithm yield,approximation algorithms,decoding,computational complexity,laurent polynomial,construction industry,polynomials,computer science,minimal polynomial,symbolic computation,discrete mathematics,information theory,berlekamp massey algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要