Takahiro Sakata

Learn More
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