𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved results on the probabilistic theory of the joint linear complexity of multisequences

✍ Scribed by Harald Niederreiter; Michael Vielhaber; LiPing Wang

Book ID
107359994
Publisher
Science in China Press (SCP)
Year
2011
Tongue
English
Weight
153 KB
Volume
55
Category
Article
ISSN
1674-733X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The expected value of the joint linear c
The expected value of the joint linear complexity of periodic multisequences
✍ Wilfried Meidl; Harald Niederreiter πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 153 KB

Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequen

On the complexity of inference about pro
On the complexity of inference about probabilistic relational models
✍ Manfred Jaeger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha