✦ LIBER ✦

A characterization of complexity sequences

✍ Scribed by C. P. Schnorr; G. Stumpf

Publisher: John Wiley and Sons
Year: 1975
Tongue: English
Weight: 678 KB
Volume: 21
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19750210106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of Markov sequences

✍ G.L. Wise; J.B. Thomas 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Second moment properties of a class of Markov sequences are established through a diagonal series expansion of the b&variate density function of the sequence. It is shown that if the expansion coe@cients are raised to any positive integer power, the resulting series converges to a bivariate density.

A characterization of finite unions of a

A characterization of finite unions of arithmetic sequences

✍ Štefan Porubský 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A characterization of unions of finite terms of Be: noulli polynomials is given. systems of residue c!asses a, (mod n, 1. 1 d s d k, in )er finite systems of residue classes a, (mod n,), Osa$q, s= I,2 ,.... k (1)

Perfect staircase profile of linear comp

Perfect staircase profile of linear complexity for finite sequences

✍ Masakatu Morii; Masao Kasahara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Linear Complexity of Generalized Cycloto

Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2

✍ Cunsheng Ding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 233 KB

There are several kinds of cyclotomic sequences. They have a number of good randomness properties. In this paper we calculate the linear complexity (linear span) of generalized cyclotomic binary sequences of order 2. Our results show that their linear complexity is quite good.

A characterization of time complexity by

A characterization of time complexity by simple loop programs

✍ Takumi Kasai; Akeo Adachi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 772 KB

A Characterization of the degree sequenc

A Characterization of the degree sequences of 2-trees

✍ Prosenjit Bose; Vida Dujmovi; Danny Krizanc; Stefan Langerman; Pat Morin; David 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views

## Abstract A graph __G__ is a 2‐tree if __G__ = __K__~3~, or __G__ has a vertex __v__ of degree 2, whose neighbors are adjacent, and __G__/ __v__ is a 2‐ tree. A characterization of the degree sequences of 2‐trees is given. This characterization yields a linear‐time algorithm for recognizing and r