Counting Functions and Expected Values for the k-Error Linear Complexity
โ Scribed by Wilfried Meidl; Harald Niederreiter
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 126 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
In cryptology, complexity measures for sequences of elements of a "nite "eld, such as the linear complexity, play an important role. Cryptographically strong sequences or "nite strings must not only have a large linear complexity, but also the change of a few terms must not cause a signi"cant decrease of the linear complexity. This requirement leads to the concept of the k-error linear complexity ยธLI (S) of a string S with terms in a "nite "eld F O and length n. In this article, bounds for the number of strings S of length n with k-error linear complexity ยธLI (S)"c or ยธLI (S)4c for a given c are established. Under certain conditions on n, k, and c, exact formulas are also determined. On the basis of these results we derive bounds for the expected value of ยธLI (S) for random strings S of length n.
๐ SIMILAR VOLUMES
Theoretical accuracies are studied for asymtotic approximations of the expected probabilities of misclassification (EPMC) when the linear discriminant function is used to classify an observation as coming from one of two multivariate normal populations with a common covariance matrix. The asymptotic
A new integral representation of the Green's function for k, n y k conjugate boundary value problems is obtained. Its applications are also given. แฎ 2001
In the paper, we shall prove that almost everywhere convergent bounded sequence in a Banach function space X is weakly convergent if and only if X and its dual space X\* have the order continuous norms. It follows that almost everywhere convergent bounded sequence in ยธN #ยธN (1(p , p (R) is weakly co