The Iteration Protocols Sample Clauses

The Iteration Protocols. ≥ The repetition code protocol has the property that when N increases, β decreases faster than γ. Hence, there exists an N0 such that β < γ when N N0. However, when N increases, Rβ(ϵ0) decreases exponentially in N. The repetition code protocol turns out to be extremely inefficient in terms of information rate. This case occurs when pE is much smaller than pA and pB, since a large codeword length N has to be employed by Xxxxx and Xxx to gain an advantage over Xxx. To improve the efficiency of the protocol, Xxxxxx proposed to use iteration protocols in [42]. An iteration protocol consists of several rounds, and each round uses a repetition code protocol but with only shorter codeword length b. Xxxxx’s and Bob’s strings shrink round after round, but their strings become more and more reliable. It was shown in [42] that a k-round iteration protocol with code length b corresponds to a N = bk repetition code protocol, except that the iteration protocol comes up with a larger information rate than the iteration protocol. We give the following formal definition of an iteration protocol.