𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound on the linear span of an FCSR

✍ Scribed by Changho Seo; Sangjin Lee; Yeoulouk Sung; Keunhee Han; Sangchoon Kim

Book ID
114541553
Publisher
IEEE
Year
2000
Tongue
English
Weight
108 KB
Volume
46
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the linear complexity of FCSR sequenc
On the linear complexity of FCSR sequences
✍ Wenfeng Qi; Hong Xu πŸ“‚ Article πŸ“… 2003 πŸ› SP Editorial Committee of Applied Mathematics - A 🌐 English βš– 283 KB
A lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
✍ Katherine Heinrich; Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

A linear lower bound on the unbounded er
A linear lower bound on the unbounded error probabilistic communication complexity
✍ JΓΌrgen Forster πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfΓ€1; 1g nΓ‚n and any matrix MAR nΓ‚n such that signΓ° Mi;j Þ ΒΌ M i;j for all i; j; then rankΓ° MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of