A commonly used superincreasing sequence is that of powers of two (.)
Suppose that . If is a superincreasing sequence and every , then we can always determine the ’s simply by knowing . This is analogous to the fact that, for any natural number, we can always determine which bits are on and off in the binary bitstring representing the number.
|Date of creation||2013-03-22 11:55:22|
|Last modified on||2013-03-22 11:55:22|
|Last modified by||Wkbj79 (1863)|