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
## 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
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
An (n, m, w)-perfect hash family is a set of functions F such that f : (1