A combinatorial approach to binary positional number systems
β Scribed by Vince, Andrew
- Book ID
- 121591852
- Publisher
- Akadmiai Kiad
- Year
- 2013
- Tongue
- English
- Weight
- 612 KB
- Volume
- 143
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given a sample with replacement from a finite set ~, we show simply how to generate a maximal sequence of functions of the sample, all uniform on ~/, such that these functions are pairwise independent. We also consider the problem of generating a sequence of k-wise independent functions of the sampl
For an expanding matrix H β Z kΓk , a subset W β Z k is called a complete digit set, if all points of the integer lattice Z k can be uniquely represented as a finite sum x = N(x) i=0 H i r i , with r i β W and N(x) β N. We present a necessary and sufficient condition for the existence of a complete