Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
スポンサーリンク
概要
- 論文の詳細を見る
Firstly we show a useful property of the fast algorithm for computing linear complexities of p-ary periodic sequences with period p^n (p: a prime). Secondly the property is successfully applied to obtain the value distribution of the linear complexity for p-ary periodic sequences with period p^n.
- 社団法人電子情報通信学会の論文
- 1997-05-25
著者
-
Uehara Satoshi
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Imamura Kyoki
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Kaida Takayasu
Department Of Information And Computer Sciences Faculty Of Humanity-oriented Science And Engineering
関連論文
- Characteristic Polynomials of Binary Complementary Sequences
- A Note on the Shift Bound for Cyclic Codes by the DFT
- Balanced Binary Sequences with Optimal Periodic Correlation Properties
- Linear Complexity of Periodic Sequences Obtained from a Sequence over GF(p) with Period p^n-1 by One-Symbol Deletion
- Some Properties of Logistic Maps over Integers
- On p-Ary Bent Sequences
- Approximate Odd Periodic Correlation Distributions of Binary Sequences (Special Issue on Spread Spectrum Techniques and Applications)
- Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
- Some Properties of Partial Autocorrelation of Binary M-Sequences (Special Section on Information Theory and Its Applications)
- Some Properties of the Schaub Bound and Its Improvement for Cyclic Codes
- On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements(Sequence Design and its Application in Communications)
- A Note on Decoding Algorithm by Calculation of Schaub Bound for Cyclic Codes
- On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
- An Improvement of the Hartmann-Tzeng Bound for Cyclic Codes and Their Binary and Short Examples
- Rounding Logistic Maps over Integers and the Properties of the Generated Sequences
- Construction of Independent Set and Its Application for Designed Minimum Distance
- On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets