The Cascade Protocol Sample Clauses

The Cascade Protocol. The Cascade protocol [7] also consists of several passes. In the first pass, the block length w1 is determined by the initial bit error probability p according to some rule wi (we will show the rule later). The positions of the bits in Xxxxx’s and Bob’s initial strings are indexed by 1, 2, . . . , n. Xxxxx and Xxx divide their strings into blocks. Block v in Pass 1, denoted by Block1, is composed of those bits whose positions come from the set K1 = l (v 1)w1 < l vw1 . For each block, they exchange parities and perform a binary search to correct an error in case of different parities. After Pass 1, all blocks or sublocks have an even (including zero) number of errors. In Pass i, i > 1, Xxxxx and Xxx set the block length to wi = 2wi—1. After a random permutation of their strings, they separate the strings into n blocks, not necessarily of equal size. More precisely, they choose a random function fi : wi [1, 2, . . . , n] → [1, 2 . . . , [ n |], and the bits from the set Ki = {l|fi(l) = j} form