𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strengthening hash families and compressive sensing

✍ Scribed by Colbourn, Charles J.; Horsley, Daniel; Syrotiuk, Violet R.


Book ID
119292771
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
328 KB
Volume
16
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Constructions of 2-cover-free families a
✍ P. C. Li; G. H. J. van Rees; R. Wei πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 158 KB

## Abstract Cover‐free families (CFFs) were considered from different subjects by numerous researchers. In this article, we mainly consider explicit constructions of (2; __d__)‐cover‐free families. We also determine the size of optimal 2‐cover‐free‐families on 9, 10, and 11 points. Related separati

Perfect Hash Families: Probabilistic Met
✍ Simon R. Blackburn πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 113 KB

An (n, q, t)-perfect hash family of size s consists of a set V of order n, a set F of order q, and a sequence , 1 , , 2 , ..., , s of functions from V to F with the following property. For all t-subsets X V, there exists i # [1, 2, ..., s] such that , i is injective when restricted to X. An (n, q, t

Some recursive constructions for perfect
✍ M. Atici; S. S. Magliveras; D. R. Stinson; W.-D. Wei πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 452 KB

An (n, m, w)-perfect hash family is a set of functions F such that f : (1

Compressive Sensing [Lecture Notes]
✍ Baraniuk, Richard G. (author) πŸ“‚ Article πŸ“… 2007 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 418 KB