#### Filter Results:

- Full text PDF available (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto
- IEEE Trans. Information Theory
- 2000

The -error linear complexity of a periodic sequence of period is defined as the smallest linear complexity that can be obtained by changing or fewer bits of the sequence per period. This correspondence shows a relationship between the linear complexity and the minimum value for which the -error linear complexity is strictly less than the linear complexity.

The k-error linear complexity of a periodic sequence of period N is deened as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This paper shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.

- ‹
- 1
- ›