GF(q) sequences of period q/sup n/-1 with maximum linear complexity and maximum order complexities for minimum changes of m-sequences
説明
Among GF(q) sequences of period N=q/sup n/-1 m-sequences are known to have minimum linear complexity (LC) of n. LCs for minimum changes of m-sequences are shown to be maximum, i.e. N. First it is shown that this maximum LC property is not peculiar to m-sequences if q/spl ne/2 or N is not prima. Secondly maximum order complexities (MOC) for minimum changes of m-sequences have reasonable values between n and 2n. >
収録刊行物
-
- Proceedings of 1994 IEEE International Symposium on Information Theory
-
Proceedings of 1994 IEEE International Symposium on Information Theory 366-, 2002-12-17
IEEE