摘要
利用伽罗华环上元素的p -adic表示 ,对有限域上的Berlekamp -Massey算法加以改进 ,解决了伽罗华环上的序列综合问题 ,即求解最短的线性递归关系 ,使之生成伽罗环上的已知序列 .该算法可以应用于某些循环码的解码 .
Shift-register synthesis over Galois rings is studied,i.e.,finding the shortest linear recurrence which can generate the given sequence over Galois rings. The similar problem over finite fields has been solved. and used successfully in decoding some cyclic codes.In this correspondence,by modifying the Berlekamp-Massey algorithm over finite fields and using the p-adic representations of elements over Galois rings,an algorithm is given for solving this problem over Galois rings.
出处
《东北师大学报（自然科学版）》
CAS
CSCD
北大核心
2002年第3期36-42,共7页
Journal of Northeast Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目 ( 6 9972 0 36 )
